Computer Science – Discrete Mathematics
Scientific paper
2007-12-16
Computer Science
Discrete Mathematics
16 pages, 8 figures. A few words were missing in the initial version
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 give a partial answer: when the configurations are restricted to a certain condition, the problem is undecidable.
No associations
LandOfFree
Is the injectivity of the global function of a cellular automaton in the hyperbolic plane 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 Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-446090