$\it \Pi^0_1$ Sets and Tilings

DOI10.1007/978-3-642-20877-5_24zbMath1333.03109OpenAlexW1653243119MaRDI 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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Other Turing degree structures (03D28)

Related Items (2)

Quasiperiodicity and Non-computability in Tilings ⋮ Hardness of conjugacy, embedding and factorization of multidimensional subshifts

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

This page was built for publication: $\it \Pi^0_1$ Sets and Tilings