Intrinsically Universal Cellular Automata

This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for proving non universality.

[1]  B. Durand,et al.  The Game of Life: Universality Revisited , 1999 .

[2]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[3]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[4]  Guillaume Theyssier.  Automates cellulaires : un modèle de complexités , 2005 .

[5]  D. Richardson,et al.  Tessellations with Local Transformations , 1972, J. Comput. Syst. Sci..

[6]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[7]  Nicolas Ollinger,et al.  A Particular Universal Cellular Automaton , 2008, CSP.

[8]  Nicolas Ollinger.  Universalities in cellular automata a (short) survey , 2008, JAC.

[9]  G. A. Hedlund.  Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.

[10]  Karel Culik,et al.  A Simple Universal Cellular Automaton and its One-Way and Totalistic Version , 1987, Complex Syst..

[11]  Jérôme Durand-Lose,et al.  Universality of Cellular Automata , 2009 .

[12]  E. R. Banks.  INFORMATION PROCESSING AND TRANSMISSION IN CELLULAR AUTOMATA , 1971 .

[13]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[14]  Nicolas Ollinger,et al.  The Quest for Small Universal Cellular Automata , 2002, ICALP.

[15]  Turlough Neary,et al.  P-completeness of Cellular Automaton Rule 110 , 2006, ICALP.

[16]  Nicolas Ollinger.  The Intrinsic Universality Problem of One-Dimensional Cellular Automata , 2003, STACS.

[17]  Franco Bagnoli,et al.  Cellular Automata , 2002, Lecture Notes in Computer Science.

[18]  Matthew Cook,et al.  Universality in Elementary Cellular Automata , 2004, Complex Syst..

[19]  Jarkko Kari,et al.  Theory of cellular automata: A survey , 2005, Theor. Comput. Sci..

[20]  Nicolas Ollinger.  Automates cellulaires : structures , 2002 .

[21]  Alvy Ray Smith,et al.  Simple Computation-Universal Cellular Spaces , 1971, JACM.

[22]  Elwyn R. Berlekamp,et al.  Winning Ways for Your Mathematical Plays, Volume 2 , 2003 .

[23]  Ivan Rapaport,et al.  Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results , 1999, Discret. Math..