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]. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
APA
Kari, J. (2007). The tiling problem revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4664 LNCS, pp. 72–79). Springer Verlag. https://doi.org/10.1007/978-3-540-74593-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free