Computability of Countable Subshifts

13 years 9 months ago

Download www.math.ufl.edu

We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any rank one subshift in 2Z is is decidable. Subshifts of rank two may contain members of arbitrary Turing degree. In contrast, eﬀectively closed (Π0 1 ) subshifts of rank two contain only computable elements, but Π0 1 subshifts of rank three may contain members of arbitrary ∆0 2 degree. There is no subshift of rank ω.

Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Seb

Real-time Traffic

Applied Computing | Arbitrary Turing Degree | CIE 2010 | Countable Subshifts | Periodic Elements |

claim paper

» Towards a Rice Theorem on Traces of Cellular Automata

» Zigzags in Turing Machines

» Subshifts Languages and Logic

» Factorization forests for infinite words and applications to countable scattered linear or...

» An Order on Sets of Tilings Corresponding to an Order on Languages

» Do Noetherian Modules Have Noetherian Basis Functions

» Using an Ontology to Determine English Countability

» On selfembeddings of computable linear orderings

Post Info
More Details (n/a)

Added	24 Jan 2011
Updated	24 Jan 2011
Type	Journal
Year	2010
Where	CIE
Authors	Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman

Comments (0)

Sciweavers

Computability of Countable Subshifts

Applied Computing | Arbitrary Turing Degree | CIE 2010 | Countable Subshifts | Periodic Elements |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers