Computer Science – Computational Geometry
Scientific paper
2007-06-28
The Bulletin of EATCS, 93(Oct.), (2007), 220-237
Computer Science
Computational Geometry
18 pages, This is a synthesis of previous deposits
Scientific paper
In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael Robinson in 1971, in his famous simplified proof that the general tiling problem is undecidable for the Euclidean plane, initially proved by Robert Berger in 1966.
No associations
LandOfFree
The Domino Problem of the Hyperbolic Plane Is Undecidable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Domino Problem of the Hyperbolic Plane Is Undecidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Domino Problem of the Hyperbolic Plane Is Undecidable will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-456325