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 limit sets of cellular automata: they are the same as the sets of Turing degrees of effectively closed sets containing a computable point. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Borello, A., Cervelle, J., & Vanier, P. (2014). Turing degrees of limit sets of cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8573 LNCS, pp. 74–85). Springer Verlag. https://doi.org/10.1007/978-3-662-43951-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
