Undecidability and nonperiodicity for tilings of the plane

@article{Robinson1971UndecidabilityAN,
  title={Undecidability and nonperiodicity for tilings of the plane},
  author={R. M. Robinson},
  journal={Inventiones mathematicae},
  year={1971},
  volume={12},
  pages={177-209}
}
  • R. M. Robinson
  • Published 1971
  • Mathematics
  • Inventiones mathematicae
  • This paper is related to the work of Hao Wang and others growing out of a problem which he proposed in [8], w 4.1. Suppose that we are given a finite set of unit squares with colored edges, placed with their edges horizontal and vertical. We are interested in tiling the plane with copies of these tiles obtained by translation only. The tiles are to be placed with their vertices at lattice points, and abutting edges must have the same color. Wang raised the question whether there is a general… CONTINUE READING
    618 Citations
    Nonrecursive Tilings of the Plane. I
    • W. Hanf
    • Mathematics, Computer Science
    • J. Symb. Log.
    • 1974
    • 65
    Nonrecursive Tilings of the Plane. II
    • D. Myers
    • Mathematics, Computer Science
    • J. Symb. Log.
    • 1974
    • 81
    Tiling Problem
    • Highly Influenced
    • PDF
    Decidability and Periodicity of Low Complexity Tilings
    • 5
    • PDF
    Tiling with polyominoes and combinatorial group theory
    • 206
    • PDF
    Nonemptiness problems of plane square tiling with two colors
    • 8
    • PDF
    The pinwheel tilings of the plane
    • 185
    • PDF
    CHAPTER 3.5 – Tilings
    • 11
    A family of non-periodic tilings of the plane by right golden triangles
    • PDF
    Polyominoes simulating arbitrary-neighborhood zippers and tilings
    • PDF

    References

    SHOWING 1-10 OF 12 REFERENCES
    Proving theorems by pattern recognition — II
    • 760
    Universality of Tag Systems with P = 2
    • 73
    • PDF
    Proving theorems by pattern recognition I
    • H. Wang
    • Mathematics, Computer Science
    • CACM
    • 1960
    • 378
    • PDF
    The undecidability of the domino problem
    • 912
    Turing-machines and the Entscheidungsproblem
    • 62
    Seven polygons which permit only nonperiodic tilings of the plane ( abstract )
    • Notices Amer . Math . Soc .
    • 1967
    Seven polygons which permit only nonperiodic tilings of the plane (abstract). Notices Amer
    • Math. Soc
    • 1967
    ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE.
    • A. S. Kahr, E. F. Moore, H. Wang
    • Computer Science, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 1962
    • 87
    • PDF
    Entscheidungsproblem reduced to the V ? IV case
    • Proc . Nat . Acad . Sci . U . S . A .
    • 1962
    H: Entscheidungsproblem reduced to the V?IV case
    • Proc. Nat. Acad. Sci. U.S.A. 48
    • 1962