50 search results - page 9 / 10 » Intrinsically Universal Cellular Automata |
MCU
2004
13 years 6 months ago
2004
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
FUIN
2006
13 years 5 months ago
2006
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
CIE
2005
Springer
13 years 10 months ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
MCU
1998
13 years 6 months ago
1998
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
ACRI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...