The quest for small universal cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 318-329

  Ollinger, Nicolas ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA;

COMPUTATIONAL UNIVERSALITY; INTRINSIC UNIVERSALITIES; LOWER BOUNDS; VON NEUMANN NEIGHBORHOOD;

ONE DIMENSIONAL;

EID: 84869156668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_28     Document Type: Conference Paper

References (13)

1. J. Albert and K. Čulik II, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems, 1(1987), no. 1, 1-16.
2. E. R. Banks, Universality in cellular automata, in Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pages 194-215, IEEE, 1970.
3. E. Codd, Cellular Automata, Academic Press, 1968.
4. M. Kudlek and Y. Rogozhin, New small universal circular Post machines, in R. Freivalds, editor, Proceedings of FCT'2001, volume 2138 of LNCS, pages 217-226, 2001.
5. K. Lindgren and M. G. Nordahl, Universal computation in simple one-dimensional cellular automata, Complex Systems, 4(1990), 299-318.
6. J. Mazoyer and I. Rapaport, Inducing an order on cellular automata by a grouping operation, Discrete Appl. Math., 218(1999), 177-196.
7. M. Minsky, Finite and Infinite Machines, Prentice Hall, 1967.
8. N. Ollinger, Toward an algorithmic classification of cellular automata dynamics, 2001, LIP RR2001-10, http://www.ens-lyon.fr/LIP.
9. N. Ollinger, Two-states bilinear intrinsically universal cellular automata, in R. Freivalds, editor, Proceedings of FCT'2001, volume 2138 of LNCS, pages 396-399, 2001.
10. C. E. Shannon, A universal Turing machine with two internal states, Ann. Math. Stud., 34(1956), 157-165.
11. A. R. Smith III, Simple computation-universal cellular spaces, J. ACM, 18(1971), no. 3, 339-353.
12. J. von Neumann, Theory of Self-reproducing Automata, University of Illinois Press, Chicago, 1966.
13. I. Wegener, The complexity of boolean functions, Wiley-Teubner, 1987.