The Tiling Problem Revisited (Extended Abstract)
- Cite this paper as:
- Kari J. (2007) The Tiling Problem Revisited (Extended Abstract). In: Durand-Lose J., Margenstern M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg
We give a new proof for the undecidability of the tiling problem. Then we show how the proof can be modified to demonstrate the undecidability of the tiling problem on the hyperbolic plane, thus answering an open problem posed by R.M.Robinson 1971 .
Unable to display preview. Download preview PDF.