Complex tilings
From MaRDI portal
Publication:3503757
DOI10.2178/jsl/1208359062zbMath1141.03021arXivcs/0107008OpenAlexW3037410039WikidataQ57349697 ScholiaQ57349697MaRDI QIDQ3503757
Leonid A. Levin, Alexander Shen, Bruno Durand
Publication date: 9 June 2008
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0107008
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Other Turing degree structures (03D28)
Related Items
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts ⋮ Shift-complex sequences ⋮ Cototal enumeration degrees and their applications to effective mathematics ⋮ Quasiperiodicity and Non-computability in Tilings ⋮ Turing degrees of multidimensional SFTs ⋮ DEEP CLASSES ⋮ Seas of squares with sizes from a \(\Pi_{1}^{0}\) set ⋮ Countable sofic shifts with a periodic direction ⋮ Fixed-point tile sets and their applications ⋮ Fixed Point and Aperiodic Tilings ⋮ Two notes on subshifts ⋮ Kolmogorov Complexity as a Language ⋮ $\it \Pi^0_1$ Sets and Tilings ⋮ Aperiodic tilings and entropy ⋮ Effective Closed Subshifts in 1D Can Be Implemented in 2D ⋮ The expressiveness of quasiperiodic and minimal shifts of finite type ⋮ Asymptotic Cellular Complexity ⋮ Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts ⋮ Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type ⋮ On the Expressive Power of Quasiperiodic SFT.
Cites Work
