Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
438059 | Theoretical Computer Science | 2008 | 56 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics