 |
Conference papers
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.
Cited literature [25 references]
https://hal.archives-ouvertes.fr/hal-00947323
Contributor : Pascal Vanier <>
Submitted on : Saturday, February 15, 2014 - 2:00:57 PM
Last modification on : Friday, October 4, 2019 - 1:13:17 AM
Document(s) archivé(s) le : Thursday, May 15, 2014 - 11:20:52 AM
Contributor : Pascal Vanier <>
Submitted on : Saturday, February 15, 2014 - 2:00:57 PM
Last modification on : Friday, October 4, 2019 - 1:13:17 AM
Document(s) archivé(s) le : Thursday, May 15, 2014 - 11:20:52 AM
Files
icalp.pdf
Files produced by the author(s)
