2000 character limit reached
An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid
Published 17 Jun 2010 in cs.FL | (1006.3451v1)
Abstract: In this paper, following the way opened by a previous paper deposited on arXiv, 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.