About the domino problem in the hyperbolic plane from an algorithmic point of view
From MaRDI portal
Publication:3514632
Abstract: In this paper, we prove that the general problem of tiling the hyperbolic plane with `a la Wang tiles is undecidable.
Recommendations
Cites work
- A strongly aperiodic set of tiles in the hyperbolic plane
- Cellular automata in hyperbolic spaces. Vol 1: Theory
- scientific article; zbMATH DE number 5605129 (Why is no real title available?)
- New tools for cellular automata in the hyperbolic plane
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(9)- Undecidable tiling problems in the hyperbolic plane
- An algorithmic approach to tilings of hyperbolic spaces: universality results
- An algorithmic approach to tilings of hyperbolic spaces: 10 years later
- THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE
- The Tiling Problem Revisited (Extended Abstract)
- The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane
- Domino Problem Under Horizontal Constraints
- A heuristic approach to domino grid problem
- The domino problem of the hyperbolic plane is undecidable
This page was built for publication: About the domino problem in the hyperbolic plane from an algorithmic point of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514632)