The tiling problem revisited

Authors:
Jarkko Kari
Affiliations:
Department of Mathematics, University of Turku, Finland
Venue:
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Year:
2007

Citing 1
Cited 10

A small aperiodic set of Wang tiles

Discrete Mathematics

Two-by-Two Substitution Systems and the Undecidability of the Domino Problem

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The domino problem of the hyperbolic plane is undecidable

Theoretical Computer Science
Regular production systems and triangle tilings

Theoretical Computer Science
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable

Fundamenta Informaticae
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane

Electronic Notes in Theoretical Computer Science (ENTCS)
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane

Theoretical Computer Science
On the undecidability of the tiling problem

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Note: The periodic domino problem revisited

Theoretical Computer Science
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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