Computability in Symbolic Dynamics
From MaRDI portal
Publication:3188248
DOI10.1007/978-3-319-40189-8_13zbMath1476.03056OpenAlexW2483446193MaRDI QIDQ3188248
Publication date: 17 August 2016
Published in: Pursuit of the Universal (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01445688/file/syndyn.pdf
Symbolic dynamics (37B10) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Substitution-dynamics and invariant measures for infinite alphabet-path space ⋮ The work of Mike Hochman on multidimensional symbolic dynamics and Borel dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- Turing degrees of multidimensional SFTs
- Mass problems associated with effectively closed sets
- On the dynamics and recursive properties of multidimensional symbolic systems
- On topological dynamics of Turing machines
- Turing degree spectra of minimal subshifts
- Undecidability and nonperiodicity for tilings of the plane
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Subgroups of finitely presented groups
- Degrees of models
- Computable symbolic dynamics
- Effective Closed Subshifts in 1D Can Be Implemented in 2D
- Reducibility and Completeness for Sets of Integers
- Generalized one-sided shifts and maps of the interval
- Nonrecursive tilings of the plane. II
- An Introduction to Symbolic Dynamics and Coding
- Effective Symbolic Dynamics
- Characterizations of periods of multi-dimensional shifts
- Two notes on subshifts
- Medvedev degrees of two-dimensional subshifts of finite type
- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
- The undecidability of the domino problem
