Sciweavers

50 search results - page 1 / 10
» A Particular Universal Cellular Automaton
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 15 days 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
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 10 months ago
An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid
In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pe...
Maurice Margenstern
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 4 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...
STACS
1997
Springer
14 years 2 months ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose
TCS
2011
13 years 5 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