Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable?
| dc.creator | Maurice, Margenstern | |
| dc.date | 2007-12-16 | |
| dc.date | 2007-12-20 | |
| dc.date.accessioned | 2026-07-07T08:50:15Z | |
| dc.date.available | 2026-07-07T08:50:15Z | |
| dc.description | 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. | |
| dc.description | 16 pages, 8 figures. A few words were missing in the initial version | |
| dc.identifier | https://arxiv.org/abs/0712.2577 | |
| dc.identifier | http://arxiv.org/abs/0712.2577 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/144541 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.2.2 | |
| dc.title | Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? | |
| dc.type | text |