Computable symbolic dynamics
β
Douglas Cenzer; S. Ali Dashti; Jonathan L. F. King
π
Article
π
2008
π
John Wiley and Sons
π
English
β 149 KB
## Abstract We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Ξ ^0^~1~ class __P__ is a subshift if and only if there exists a computable function __F__ mapping 2^β^ to 2^β^ such that __P__ is the set of itineraries of elements of 2