A universal cellular automaton on the heptagrid of the hyperbolic plane with four states

In this paper, we construct a new weakly universal cellular automaton on the ternary heptagrid. This significantly improves the previous result, obtained by the same author in the same grid with six states. This time, the number of states is four. This is the best result up to date for cellular automata in the hyperbolic plane, with true planar motions.

[1]  Maurice Margenstern.  The Domino Problem of the Hyperbolic Plane is Undecidable , 2007, Bull. EATCS.

[2]  Yu Song,et al.  A New Universal Cellular Automaton on the Pentagrid , 2009, Parallel Process. Lett..

[3]  Maurice Margenstern.  Cellular Automata in Hyperbolic Spaces , 2009, Encyclopedia of Complexity and Systems Science.

[4]  Maurice Margenstern.  On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane , 2008, Int. J. Found. Comput. Sci..

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

[6]  Maurice Margenstern,et al.  Surprising Areas in the Quest for Small Universal Devices , 2006, MFCSIT.

[7]  Maurice Margenstern,et al.  Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey , 2003, DMTCS.

[8]  Maurice Margenstern,et al.  A universal cellular automaton in the hyperbolic plane , 2003, Theor. Comput. Sci..

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

[10]  Maurice Margenstern,et al.  NP problems are tractable in the space of cellular automata in the hyperbolic plane , 2001, Theor. Comput. Sci..

[11]  Turlough Neary,et al.  Small Semi-weakly Universal Turing Machines , 2007, MCU.

[12]  Ian Stewart,et al.  A Subway Named Turing , 1994 .

[13]  Maurice Margenstern.  A new universal cellular automaton on the ternary heptagrid , 2009, ArXiv.

[14]  Maurice Margenstern,et al.  A Universal Cellular Automaton on the Ternary Heptagrid , 2008, Electron. Notes Theor. Comput. Sci..

[15]  Maurice Margenstern.  Two railway circuits: a universal circuit and an NP-difficult one , 2001, Comput. Sci. J. Moldova.

[16]  Maurice Margenstern,et al.  New Tools for Cellular Automata in the Hyperbolic Plane , 2000, J. Univers. Comput. Sci..