On the undecidability of the tiling problem

Authors:
Jarkko Kari
Affiliations:
Department of Mathematics, University of Turku, Finland
Venue:
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Year:
2008

Citing 4
Cited 0

Computability with low-dimensional dynamical systems

Theoretical Computer Science
A small aperiodic set of Wang tiles

Discrete Mathematics
Deciding stability and mortality of piecewise affine dynamical systems

Theoretical Computer Science
The tiling problem revisited

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [9].