On the Undecidability of the Tiling Problem
- Cite this paper as:
- Kari J. (2008) On the Undecidability of the Tiling Problem. In: Geffert V., Karhumäki J., Bertoni A., Preneel B., Návrat P., Bieliková M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg
The tiling problem is the decision problem to determine if a given finite collection of Wang tiles admits a valid tiling of the plane. In this work we give a new proof of this fact based on tiling simulations of certain piecewise affine transformations. Similar proof is also shown to work in the hyperbolic plane, thus answering an open problem posed by R.M.Robinson 1971 .
Unable to display preview. Download preview PDF.