Computer Science – Computational Geometry
Scientific paper
2008-06-10
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable, Fundamenta Informaticae
Computer Science
Computational Geometry
9 figures this paper completely solves the problem tackled in arXiv:0712.2577v2. This version is simply an improvement of the
Scientific paper
In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane and we consider the global function defined on all possible configurations. Is the injectivity of this function undecidable? The problem was answered positively in the case of the Euclidean plane by Jarkko Kari, in 1994. In the present paper, we show that the answer is also positive for the hyperbolic plane: the problem is undecidable.
No associations
LandOfFree
The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable 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 The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-174699