An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid

In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pentagrid. Indeed, we prove that there is a hyperbolic cellular automaton which is rotation invariant and whose halting problem is undecidable and which has 9 states.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Maurice Margenstern
• Keywords: CORR 2010, Education, Hyperbolic Cellular Automaton, Paper, Upper Bound