139 search results - page 1 / 28 » How Common Can Be Universality for Cellular Automata |
125
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
152
click to vote
GECCO
2004
Springer
15 years 9 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...
157
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
219
click to vote
IANDC
2008
15 years 4 months ago
2008
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
178
click to vote
JAC
2008
15 years 5 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...