500 search results - page 2 / 100 » Universality and 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...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
89
Voted
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...
102
click to vote
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 ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...