| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422159 | Electronic Notes in Theoretical Computer Science | 2008 | 11 Pages |
Abstract
We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable class P is a subshift if and only if there is a computable function F mapping N2 to N2 such that P is the set of itineraries of elements of N2. A subshift is constructed which has no computable element. We also consider the symbolic dynamics of maps on the unit interval.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
