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

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

2010-06-17

arxiv.org/abs/1006.3451v1

Computer Science

Formal Languages and Automata Theory

17 pages, 9 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551902