A New Universal Cellular Automaton Discovered by Evolutionary Algorithms

In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense). All the elements of the evolutionary algorithms that were used to find R are provided for replicability, as well as the analytical description in R of a cell of Life.

• Type: Conference
• Year: 2004
• Where: GECCO
• Authors: Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Chabrier, Pierre Collet
• Keywords: Cellular Automata, Common Computational Universality, GECCO 2004, Universal Cellular Automaton