Computable symbolic dynamics
Copyright policy )Computable symbolic dynamics
AbstractWe investigate computable subshifts and the connection with effective symbolic dynamics. It is shown that a decidable Π01 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ℕ. Π01 subshifts are constructed in 2ℕ and in 2ℤ which have no computable elements. We also consider the symbolic dynamics of maps on the unit interval. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
- University of Florida United States
computability, computable closed sets, Applications of computability and recursion theory, symbolic dynamics, Symbolic dynamics, Constructive real analysis, Constructive and recursive analysis
computability, computable closed sets, Applications of computability and recursion theory, symbolic dynamics, Symbolic dynamics, Constructive real analysis, Constructive and recursive analysis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!