Machines, Computations, and Universality

Volume 4664 of the series Lecture Notes in Computer Science pp 72-79

The Tiling Problem Revisited (Extended Abstract)

  • Jarkko KariAffiliated withDepartment of Mathematics, FIN-20014 University of Turku

* Final gross prices may vary according to local VAT.

Get Access


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