Turing degrees of limit sets of cellular automata

Abstract : Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a computable point and that any non-trivial property on them is undecidable. We go one step further in this article by giving a full characterization of the sets of Turing degrees of cellular automata: they are the same as the sets of Turing degrees of effectively closed sets containing a computable point.
Liste complète des métadonnées

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00947323
Contributor : Pascal Vanier <>
Submitted on : Saturday, February 15, 2014 - 2:00:57 PM
Last modification on : Wednesday, June 20, 2018 - 2:18:42 PM
Document(s) archivé(s) le : Thursday, May 15, 2014 - 11:20:52 AM

Files

icalp.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alex Borello, Julien Cervelle, Pascal Vanier. Turing degrees of limit sets of cellular automata. ICALP 2014, Jul 2014, Copenhaguen, Denmark. pp.74--85, ⟨10.1007/978-3-662-43951-7_7⟩. ⟨hal-00947323⟩

Share

Metrics

Record views

257

Files downloads

76