P-completeness of Cellular Automaton Rule 110

We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-complete. The result is found by showing that Rule 110 simulates deterministic Turing machines in polynomial time. As a corollary we find that the small universal Turing machines of Mathew Cook run in polynomial time, this is an exponential improvement on their previously known simulation time overhead.

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

[2]  Cristopher Moore,et al.  Predicting nonlinear cellular automata quickly by decomposing them into linear ones , 1997, patt-sol/9701008.

[3]  H. James Hoover,et al.  Limits to Parallel Computation: P-Completeness Theory , 1995 .

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[5]  Scott Aaronson,et al.  Book Review: A new kind of science , 2002 .

[6]  S. Krantz.  Book Review: A new kind of science , 2002 .

[7]  Yurii Rogozhin,et al.  Small Universal Turing Machines , 1996, Theor. Comput. Sci..

[8]  Mats G. Nordahl,et al.  Universal Computation in Simple One-Dimensional Cellular Automata , 1990, Complex Syst..

[9]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

[11]  Manfred Kudlek,et al.  A Universal Turing Machine with 3 States and 9 Symbols , 2001, Developments in Language Theory.

[12]  John Cocke,et al.  Universality of Tag Systems with P = 2 , 1964, JACM.

[13]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

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

[15]  Cristopher Moore,et al.  Quasilinear cellular automata , 1997, adap-org/9701001.

[16]  Claudio Baiocchi,et al.  Three Small Universal Turing Machines , 2001, MCU.

[17]  Turlough Neary,et al.  A small fast universal Turing machine , 2005 .

[18]  Marvin Minsky,et al.  Size and structure of universal Turing machines using Tag systems , 1962 .

[19]  Turlough Neary,et al.  Small fast universal Turing machines , 2006, Theor. Comput. Sci..

[20]  Cristopher Moore.  Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness , 1997 .

[21]  Cristopher Moore,et al.  Quasilinear cellular automata , 1997, adap-org/9701001.