论文信息 - Aperiodic Tilings: Breaking Translational Symmetry

Aperiodic Tilings: Breaking Translational Symmetry

Classical results on aperiodic tilings are rather complicated and not widely understood. In the present article, an alternative approach to these results is discussed in the hope of providing additional intuition, not apparent in classical works.

Leonid A. Levin

[1] C. Q. Lee,et al. The Computer Journal , 1958, Nature.

[2] R. Robinson. Undecidability and nonperiodicity for tilings of the plane , 1971 .

[3] Leonid A. Levin,et al. Complex tilings , 2001, STOC '01.

[4] Dale Myers,et al. Nonrecursive tilings of the plane. II , 1974, Journal of Symbolic Logic.

[5] Peter GBcsl. Reliable Cellular Automata with Self-organization , 1997 .

[6] William P. Hanf,et al. Nonrecursive tilings of the plane. I , 1974, Journal of Symbolic Logic.

[7] M. Schenkel,et al. Charles University in Prague Faculty of Mathematics and Physics , 2013 .

[8] Y. Gurevich,et al. Remarks on Berger's paper on the domino problem , 1972 .

[9] Yuri Gurevich,et al. The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[10] Robert L. Berger. The undecidability of the domino problem , 1966 .

[11] H. Gaifman,et al. Symbolic Logic , 1881, Nature.