|
Organizers |
Symbolic dynamics in the arithmetic hierarchy
by
Sebastian Wyman
University of Florida
Coauthors: Douglas Cenzer
Recently, Cenzer, Dashti, and King showed that the subshifts arising from the symbolic dynamics of computable functions on the cantor space are exactly the decidable Π10 subshifts and those arising by avoiding a c.e. set of words are exactly the Π01 subshifts. We define conservatively approximable functions and use them to find functions whose symbolic dynamics give rise to exactly the Π01 subshifts. We also give conditions on a computable set of avoidable words which give rise to exactly the decidable subshifts.
Date received: November 27, 2012
Copyright © 2012 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbfw-40.