TY - GEN
T1 - Quasi-uniform computation-universal cellular automata
AU - Sipper, Moshe
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.
PY - 1995/1/1
Y1 - 1995/1/1
N2 - Cellular automata (CA) are dynamical systems in which space and time are discrete, where each cell obeys the same rule and has a finite number of states. In this paper we study non-uniform CA, i.e. With non-uniform local interaction rules. Our focal point is the issue of universal computation, which has been proven for uniform automata using complicated designs embedded in cellular space. The computation-universal system presented here is simpler than previous ones, and is embedded in the minimal possible two-dimensional cellular space, namely 2-state, 5-neighbor (which is insufficient for universal computation in the uniform model). The space studied is quasi-uniform, meaning that a small number of rules is used (our final design consists of just two rules which is minimal), distributed such that most of the grid contains one rule except for an infinitely small region which contains the others. We maintain that such automata provide us with a simple, genera/model for studying Artificial Life phenomena.
AB - Cellular automata (CA) are dynamical systems in which space and time are discrete, where each cell obeys the same rule and has a finite number of states. In this paper we study non-uniform CA, i.e. With non-uniform local interaction rules. Our focal point is the issue of universal computation, which has been proven for uniform automata using complicated designs embedded in cellular space. The computation-universal system presented here is simpler than previous ones, and is embedded in the minimal possible two-dimensional cellular space, namely 2-state, 5-neighbor (which is insufficient for universal computation in the uniform model). The space studied is quasi-uniform, meaning that a small number of rules is used (our final design consists of just two rules which is minimal), distributed such that most of the grid contains one rule except for an infinitely small region which contains the others. We maintain that such automata provide us with a simple, genera/model for studying Artificial Life phenomena.
KW - Cellular Automaton
KW - Turing Machine
KW - Artificial Life
KW - Cellular Automaton Model
UR - http://www.scopus.com/inward/record.url?scp=84957811071&partnerID=8YFLogxK
U2 - 10.1007/3-540-59496-5_324
DO - 10.1007/3-540-59496-5_324
M3 - Conference contribution
AN - SCOPUS:84957811071
SN - 3540594965
SN - 9783540594963
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 544
EP - 554
BT - Advances in Artificial Life - 3rd European Conference on Artificial Life, Proceedings
A2 - Chacon, Pablo
A2 - Merelo, Juan Julian
A2 - Moran, Federico
A2 - Moreno, Alvaro
PB - Springer Verlag
T2 - 3rd European Conference on Artificial Life, ECAL 1995
Y2 - 4 June 1995 through 6 June 1995
ER -