We investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Pi(0)(1) class P is a subshift if and only if there exists a computable function F mapping 2(N) to 2(N) such that P is the set of itineraries of elements of 2(N). Pi(0)(1) subshifts are constructed in 2(N) and in 2(Z) which have no computable elements. We also consider the symbolic dynamics of maps on the unit interval. (C) WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
机构:
Indianapolis Purdue Univ, Indiana Univ Purdue Univ, Dept Math Sci, Indianapolis, IN 46202 USAIndianapolis Purdue Univ, Indiana Univ Purdue Univ, Dept Math Sci, Indianapolis, IN 46202 USA
机构:
Univ Sao Paulo, Dept Comp & Matemat, Fac Filosofia Ciencias & Letras, BR-14040901 Ribeirao Preto, SP, BrazilUniv Sao Paulo, Dept Comp & Matemat, Fac Filosofia Ciencias & Letras, BR-14040901 Ribeirao Preto, SP, Brazil
机构:
Univ Adelaide, Sch Math Sci, Adelaide, SA 5005, AustraliaUniv Adelaide, Sch Math Sci, Adelaide, SA 5005, Australia
Bowman, David
Flek, Ross
论文数: 0引用数: 0
h-index: 0
机构:
Eugene Lang Coll Liberal Arts, New Sch, Interdisciplinary Sci Dept, New York, NY 10011 USAUniv Adelaide, Sch Math Sci, Adelaide, SA 5005, Australia