Turing degrees of limit sets of cellular automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

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.
Fichier principal
Vignette du fichier
icalp.pdf (201.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00947323 , version 1 (15-02-2014)

Identifiers

Cite

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⟩
130 View
79 Download

Altmetric

Share

Gmail Facebook X LinkedIn More