References

  1. Alexis Ballier, Bruno Durand & Emmanuel Jeandel (2008): Structural aspects of tilings. In: Pascal Weil Susanne Albers: Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science. IBFI Schloss Dagstuhl, Bordeaux, France, pp. 61–72. Available at http://hal.archives-ouvertes.fr/hal-00145800. 11 pages.
  2. Robert Berger (1966): The undecidability of the domino problem. Mem. Amer. Math. Soc. No. 66. 72 pages.
  3. D. Cenzer & J. B. Remmel (1998): Π^0_1 classes in mathematics. In: Handbook of recursive mathematics, Vol. 2, Stud. Logic Found. Math. 139. North-Holland, Amsterdam, pp. 623–821, doi:10.1016/S0049-237X(98)80046-3.
  4. Douglas Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare & Stanley S. Wainer (1986): Members of countable Π^0_1 classes. Ann. Pure Appl. Logic 31(2-3), pp. 145–163, doi:10.1016/0168-0072(86)90067-9. Special issue: second Southeast Asian logic conference (Bangkok, 1984).
  5. Bruno Durand (1999): Tilings and quasiperiodicity. Theoret. Comput. Sci. 221(1-2), pp. 61–75, doi:10.1016/S0304-3975(99)00027-4. ICALP '97 (Bologna).
  6. Bruno Durand, Andrei Romashchenko & Alexander Shen (2010): Effective closed subshifts in 1D can be implemented in 2D. In: Fields of logic and computation, Lecture Notes in Comput. Sci. 6300. Springer, Berlin, pp. 208–226.
  7. G. A. Hedlund (1969): Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, pp. 320–375.
  8. Emmanuel Jeandel & Pascal Vanier (2011): Π_1^0 sets and tilings. In: Theory and Applications of Models of Computation (TAMC), Lecture Notes in Computer Science 6648, pp. 230–239, doi:10.1007/978-3-642-20877-5_24.
  9. G. Kreisel, J. Shoenfield & Hao Wang (1960): Number theoretic concepts and recursive well-orderings. Arch. Math. Logik Grundlagenforsch. 5, pp. 42–64.
  10. K. Kuratowski (1966): Topology. Vol. I. New edition, revised and augmented. Translated from the French by J. Jaworowski. Academic Press, New York.
  11. Douglas Lind & Brian Marcus (1995): An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge, doi:10.1017/CBO9780511626302.
  12. Marvin L. Minsky (1967): Computation: finite and infinite machines. Prentice-Hall Inc., Englewood Cliffs, N.J.. Prentice-Hall Series in Automatic Computation.
  13. Piergiorgio Odifreddi (1989): Classical recursion theory. Studies in Logic and the Foundations of Mathematics 125. North-Holland Publishing Co., Amsterdam. The theory of functions and sets of natural numbers, With a foreword by G. E. Sacks.
  14. Raphael M. Robinson (1971): Undecidability and nonperiodicity for tilings of the plane. Invent. Math. 12, pp. 177–209.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org