$\it \Pi^0_1$ Sets and Tilings
From MaRDI portal
Publication:3010404
DOI10.1007/978-3-642-20877-5_24zbMath1333.03109MaRDI QIDQ3010404
Pascal Vanier, Emmanuel Jeandel
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_24
03D15: Complexity of computation (including implicit computational complexity)
52C20: Tilings in (2) dimensions (aspects of discrete geometry)
03D28: Other Turing degree structures
Related Items
Hardness of conjugacy, embedding and factorization of multidimensional subshifts, Quasiperiodicity and Non-computability in Tilings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mass problems associated with effectively closed sets
- Effectively closed sets and graphs of computable real functions.
- Undecidability and nonperiodicity for tilings of the plane
- Complex tilings
- Computable symbolic dynamics
- Computability of Countable Subshifts
- Nonrecursive tilings of the plane. I
- Nonrecursive tilings of the plane. II
- An Introduction to Symbolic Dynamics and Coding
- Effective Symbolic Dynamics
- The undecidability of the domino problem