abstract
Wang tiles are unit size squares with colored edges. To know whether a given finite set of Wang tiles can tile the plane while respecting colors on edges is undecidable. Robinson’s tiling is an auto-similar tiling in which the computation of a Turing machine can be carried out. By using this construction and by considering a strong notion of simulation between tilings, we prove computability results for tilings. In particular, we prove theorems on tilings that are similar to Kleene’s recursion theorems. Then we define and show how to construct reductions between sets of tile sets. We generalize this construction to be able to transform a tile set with a given recursively enumerable property into a tile set with another property. These reductions lead naturally to a Rice-like theorem for tilings.
Chapter PDF
References
Allauzen (C.) and Durand (B.), The Classical Decision Problem, appendix A: “Tiling problems”, p. 407–420. Springer, 1996.
Ballier (A.), Durand (B.) and Jeandel (E.), «Structural Aspects of Tilings », to appear in Proceedings of the Symposium on Theoretical Aspects of Computer Science, 2008.
Berger (R.), «The undecidability of the domino problem », Memoirs of the American Mathematical Society, vol. 66, 1966, p. 1–72.
Cervelle (J.) and Durand (B.), «Tilings: recursivity and regularity », Theoretical Computer Science, vol. 310, nº 1-3, 2004, p. 469–477.
Culik II (K.) and Kari (J.), «On aperiodic sets of Wang tiles », in Foundations of Computer Science: Potential - Theory - Cognition, p. 153–162, 1997.
Durand (B.), «Tilings and quasiperiodicity », Theoretical Computer Science, vol. 221, nº1-2, 1999, p. 61–75.
Durand (B.), «De la logique aux pavages », Theoretical Computer Science, vol. 281, nº1-2, 2002, p. 311–324.
Durand (B.), Levin (L. A.) and Shen (A.), «Complex tilings », in Proceedings of the Symposium on Theory of Computing, p. 732–739, 2001.
Durand (B.), Romashchenko (A.) and Shen (A.), «Fixed point and aperiodic tilings », preprint.
Gurevich (Y.) and Koriakov (I.), «A remark on Berger’s paper on the domino problem », in Siberian Journal of Mathematics, 13:459–463, 1972. (In Russian).
Hanf (W. P.), «Non-recursive tilings of the plane. I », Journal of Symbolic Logic, vol. 39, nº2, 1974, p. 283–285.
Lafitte (G.) and Weiss (M.), «Universal Tilings », in Proceedings of the Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science nº 4393, p. 367–380, 2007.
Lafitte (G.) and Weiss (M.), «A topological study of tilings », to appear in Proceedings of the conference on Theory and Aspects of Models of Computation , TAMC’08, 2008.
Lafitte (G.) and Weiss (M.), «Simulation between tilings », submitted to Computability in Europe, CIE’08, 2008.
Myers (D.), «Non-recursive tilings of the plane. II », Journal of Symbolic Logic, vol. 39, nº2, 1974, p. 286–294.
Robinson (R.), «Undecidability and nonperiodicity for tilings of the plane », Inventiones Mathematicae, vol. 12, 1971, p. 177–209.
Wang (H.), «Proving theorems by pattern recognition II », Bell System Technical Journal, vol. 40, 1961, p. 1–41.
Wang (H.), «Dominoes and the ∀∃∀-case of the decision problem », in Proceedings of the Symposium on Mathematical Theory of Automata, p. 23–55, 1962.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lafitte, G., Weiss, M. (2008). Computability of Tilings. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)