Sciweavers

TCS
2011
12 years 10 months ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 5 months ago
A Particular Universal Cellular Automaton
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...
Nicolas Ollinger, Gaétan Richard
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
13 years 9 months ago
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 p...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...