6533b82dfe1ef96bd1291cec

RESEARCH PRODUCT

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms

Emmanuel SapinJean-jacques ChabrierOlivier Bailleux

subject

Block cellular automatonTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComputer sciencebusiness.industryBoolean circuitComputationGrowCut algorithmContinuous automatonTimed automatonNonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonMobile automatonStochastic cellular automatonElementary cellular automatonDeterministic automatonContinuous spatial automatonAutomata theoryArtificial intelligencebusinessComputer Science::Formal Languages and Automata TheoryAsynchronous cellular automatonQuantum cellular automaton

description

This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.

yearjournalcountryeditionlanguage
2004-01-01
https://doi.org/10.1007/978-3-540-24621-3_29