Four states are enough!

Theoretical Computer Science

Volumn 412, Issue 1-2, 2011, Pages 22-32

  Ollinger, N ^a   Richard, G ^a,b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

Bulking; Cellular automata; Intrinsic universality; Particles and collisions

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

BULKING; INTRINSIC UNIVERSALITIES; LOWER BOUNDS; TURING UNIVERSALITY;

CELLULAR AUTOMATA;

EID: 79957842761     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.08.018     Document Type: Conference Paper

References (26)

1. J. von Neumann, in: A.W. Burks (Ed.), Theory of Self-Reproducing Automata, University of Illinois Press, Urbana, Ill, 1966.
2. E.F. Codd, Cellular Automata, Academic Press, New York, 1968.
3. N. Ollinger, Universalities in cellular automata, in: G. Rozenberg, T. Baeck, J. Kok (Eds.), Handbook of Natural Computing, Springer, Berlin (in press).
4. E.R. Banks, Universality in cellular automata, in: Symposium on Switching and Automata Theory (Santa Monica, California, 1970), IEEE, 1970, pp. 194-215.
5. E.R. Banks, Information processing and transmission in cellular automata, Ph.D. thesis, Massachusetts Institute of Technology, 1971.
6. A.R. Smith, III, Simple computation-universal cellular spaces, Journal of the ACM 18 (1971) 339-353.
7. B. Durand, Z. Róka, The game of life: universality revisited, in: M. Delorme, J. Mazoyer (Eds.), Cellular automata (Saissac, 1996), Kluwer Acad. Publ., Dordrecht, 1999, pp. 51-74.
8. E.R. Berlekamp, J.H. Conway, R.K. Guy, Winning Ways for Your Mathematical Plays, vol. 2, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London, 1982, (games in particular).
9. J. Albert, K. Čulik, II, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems 1 (1) (1987) 1-16.
10. N. Ollinger, Automates cellulaires: structures, Ph.D. thesis, École Normale Supérieure de Lyon, 2002.
11. G.A. Hedlund, Endormorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory 3 (1969) 320-375.
12. D. Richardson, Tessellations with local transformations, Journal of Computer and System Sciences 6 (1972) 373-388.
13. J. Kari, Theory of cellular automata: a survey, Theoretical Computer Science 334 (2005) 3-33.
14. G. Theyssier, Automates cellulaires: un modèle de complexités, Ph.D. thesis, École Normale Supérieure de Lyon, 2005.
15. M. Delorme, J. Mazoyer, N. Ollinger, G. Theyssier, Bulking I: an abstract theory of bulking, Theoretical Computer Science, to be published. http://hal.archives-ouvertes.fr/hal-00451732/.
16. M. Delorme, J. Mazoyer, N. Ollinger, G. Theyssier, Bulking II: classifications of cellular automata, Theoretical Computer Science, to be published. http://hal.archives-ouvertes.fr/hal-00451727/.
17. N. Ollinger, The intrinsic universality problem of one-dimensional cellular automata, in: H. Alt, M. Habib (Eds.), Symposium on Theoretical Aspects of Computer Science, STACS'2003, in: Lecture Notes in Computer Science, vol. 2607, Springer, Berlin, 2003, pp. 632-641.
18. J. Mazoyer, I. Rapaport, Global fixed point attractors of circular cellular automata and periodic tilings of the plane: undecidability results, Discrete Mathematics 199 (1-3) (1999) 103-122.
19. N. Ollinger, The quest for small universal cellular automata, in: P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), International colloquium on automata, languages and programming (Málaga, Spain, 2002), in: Lecture Notes in Computer Science, vol. 2380, Springer, Berlin, 2002, pp. 318-329.
20. M. Cook, Universality in elementary cellular automata, Complex Systems 15 (2004) 1-40.
21. G. Richard, Rule 110: universality and catenations, in: B. Durand (Ed.), Symposium on Cellular Automata Journées Automates Cellulaires, JAC'2008, MCCME Publishing House, Moscow, 2008, pp. 141-160.
22. S. Wolfram, A new kind of science, Wolfram Media Inc., Champaign, Ilinois, US, United States, 2002.
23. N. Ollinger, G. Richard, Collisions and their Catenations: Ultimately Periodic Tilings of the Plane, in: IFIP-TCS, vol. 273, Springer, Boston, 2008, pp. 229-240.
24. W. Hordijk, C.R. Shalizi, J.P. Crutchfield, Upper bound on the products of particle interactions in cellular automata, Physica D 154 (3-4) (2001) 240-258.
25. R.E. Ladner, The circuit value problem is log space complete for p, SIGACT News 7 (1) (1975) 18-20.
26. T. Neary, D. Woods, P-completeness of cellular automaton rule 110, in: Proceedings of ICALP 2006, in: Lecture Notes in Computer Science, vol. 4051, Springer, Berlin, 2006, pp. 132-143.