The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane
From MaRDI portal
Publication:3646260
DOI10.1007/978-3-642-04420-5_15zbMath1298.03104arXivcs/0703153MaRDI QIDQ3646260
Publication date: 19 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0703153
51M10: Hyperbolic and elliptic geometries (general) and generalizations
51M20: Polyhedra and polytopes; regular figures, division of spaces
03D35: Undecidability and degrees of sets of sentences
05B45: Combinatorial aspects of tessellation and tiling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The domino problem of the hyperbolic plane is undecidable
- Undecidable tiling problems in the hyperbolic plane
- Undecidability and nonperiodicity for tilings of the plane
- THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE
- The Tiling Problem Revisited (Extended Abstract)
- Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment
- The undecidability of the domino problem