50 search results - page 4 / 10 » Intrinsically Universal Cellular Automata |
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
JAC
2008
14 years 11 months ago
2008
We study a way of coupling two configurations of the same cellular automaton rule for all elementary cellular automata (ECA). We experimentally show that there are only two possibl...
103
Voted
EUROGP
2003
Springer
15 years 2 months ago
2003
Springer
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
MCU
2004
14 years 11 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
ACRI
2004
Springer
15 years 1 months ago
2004
Springer