The Tiling Problem Revisited (Extended Abstract)

  • Jarkko Kari
Conference paper

DOI: 10.1007/978-3-540-74593-8_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4664)
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

Abstract

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jarkko Kari
    • 1
  1. 1.Department of Mathematics, FIN-20014 University of TurkuFinland

Personalised recommendations