Abstract
The computability of countable subshifts and their members is examined. Results include the following. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any rank one subshift, in which every limit point is periodic, is decidable. Subshifts of rank two may contain members of arbitrary Turing degree. In contrast, effectively closed (Π01) subshifts of rank two contain only computable elements, but Π01 subshifts of rank three may contain members of arbitrary c. e. degree. There is no subshift of rank ω. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Cenzer, D., Dashti, A., Toska, F., & Wyman, S. (2010). Computability of countable subshifts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6158 LNCS, pp. 88–97). https://doi.org/10.1007/978-3-642-13962-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
