On the Expressive Power of Quasiperiodic SFT.
From MaRDI portal
Publication:5111219
DOI10.4230/LIPIcs.MFCS.2017.5zbMath1441.37021arXiv1705.01876OpenAlexW2962772901MaRDI QIDQ5111219
Andrei Romashchenko, Bruno Durand
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1705.01876
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Theory of numerations, effectively presented structures (03D45) Multidimensional shifts of finite type (37B51)
Related Items (5)
Unnamed Item ⋮ The work of Mike Hochman on multidimensional symbolic dynamics and Borel dynamics ⋮ The expressiveness of quasiperiodic and minimal shifts of finite type ⋮ Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type ⋮ Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy
Cites Work
- Unnamed Item
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- Turing degrees of multidimensional SFTs
- Fixed-point tile sets and their applications
- On the dynamics and recursive properties of multidimensional symbolic systems
- Reliable computation with cellular automata
- Tilings and quasiperiodicity.
- Turing degree spectra of minimal subshifts
- Quasiperiodicity and Non-computability in Tilings
- Complex tilings
- Tilings Robust to Errors
- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
- Symbolic Dynamics
This page was built for publication: On the Expressive Power of Quasiperiodic SFT.