THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE

DOI10.1142/S0129054108006078zbMath1162.03025OpenAlexW3100073208MaRDI QIDQ3526546

Maurice Margenstern

Publication date: 25 September 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006078

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Related Items (1)

The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Undecidable tiling problems in the hyperbolic plane
• Reversibility and surjectivity problems of cellular automata
• Undecidability and nonperiodicity for tilings of the plane
• The Tiling Problem Revisited (Extended Abstract)

This page was built for publication: THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE