Abstract
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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Sapin, E., Bailleux, O., & Chabrier, J. J. (2004). Research of Complex Forms in Cellular Automata by Evolutionary Algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2936, 357–367. https://doi.org/10.1007/978-3-540-24621-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
