论文信息 - A universal cellular automaton in the hyperbolic plane

A universal cellular automaton in the hyperbolic plane

The paper gives the construction of a universal CA with 22 states in the regular rectangular pentagonal grid of the hyperbolic plane. The CA implements a railway circuit which simulates a register machine and which improves a bit already known railway simulations of a Turing machine.

Maurice Margenstern | Francine Herrmann

[1] R. A. Silverman,et al. Theory of Functions of a Complex Variable , 1968 .

[2] H. Poincaré. Théorie des groupes fuchsiens , 1882 .

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

[4] Raphael M. Robinson. Undecidable tiling problems in the hyperbolic plane , 1978 .

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

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

[7] Kenichi Morita,et al. A Simple Construction Method of a Reversible Finite Automaton out of Fredkin Gates, and Its Related Problem , 1990 .

[8] Constantin Carathéodory. Theory of Functions of a Complex Variable , 2005 .

[9] Jozef Gruska. Foundations of Computing , 1997 .

[10] Zsuzsanna Róka,et al. One-Way Cellular Automata on Cayley Graphs , 1993, Theor. Comput. Sci..

[11] Robert D. Richtmyer,et al. Introduction to Hyperbolic Geometry , 1995 .