| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437712 | Theoretical Computer Science | 2010 | 7 Pages |
Abstract
In this article, we give a new proof of the undecidability of the periodic domino problem. Compared to previous proofs, the main difference is that this one does not start from a proof of the undecidability of the (general) domino problem but only from the existence of an aperiodic tileset.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
