A universal cellular automaton in the hyperbolic plane

Authors:
Francine Herrmann;Maurice Margenstern
Affiliations:
L.I.T.A., EA 3097, Université de Metz, Ile du Saulcy, 57045 Metz Cedex, France;L.I.T.A., EA 3097, Université de Metz, Ile du Saulcy, 57045 Metz Cedex, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 4
Cited 13

One-way cellular automata on Cayley graphs

Theoretical Computer Science
Foundations of computing

Foundations of computing
NP problems are tractable in the space of cellular automata in the hyperbolic plane

Theoretical Computer Science
Computation: finite and infinite machines

Computation: finite and infinite machines

On the infinigons of the hyperbolic plane, a combinatorial approach

Fundamenta Informaticae
A Universal Cellular Automaton on the Ternary Heptagrid

Electronic Notes in Theoretical Computer Science (ENTCS)
Surprising Areas in the Quest for Small Universal Devices

Electronic Notes in Theoretical Computer Science (ENTCS)
Universal cellular automata in the hyperbolic spaces

ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Cellular automata and combinatoric tilings in hyperbolic spaces: a survey

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states

Theoretical Computer Science
An algorithmic approach to tilings of hyperbolic spaces: 10 years later

CMC'10 Proceedings of the 11th international conference on Membrane computing
A new weakly universal cellular automaton in the 3D hyperbolic space with two states

RP'11 Proceedings of the 5th international conference on Reachability problems
Causal graph dynamics

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On the Infinigons of the Hyperbolic Plane, A combinatorial approach

Fundamenta Informaticae
Universality and the halting problem for cellular automata in hyperbolic spaces: the side of the halting problem

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Causal graph dynamics

Information and Computation
Ten years of weakly universal cellular automata in the hyperbolic plane

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.