Aperiodic tilings: Breaking translational symmetry

Computer Journal

Volumn 48, Issue 6, 2005, Pages 642-645

  Levin, Leonid A ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SIMULATION; THEOREM PROVING;

APERIODIC TILINGS; PHYSICAL COMPUTING MEDIA;

COMPUTATION THEORY;

EID: 27844557000     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxh124     Document Type: Article

References (8)

1. Berger, R. (1966) The undecidability of the domino problem. Mem. Amer. Math. Soc., 66, 1-72.
2. Robinson, R. M. (1971) Undecidability and nonperiodicity of tilings of the plane. Inventiones Mathematicae, 12, 177-209.
3. Myers, D. (1974) Nonrecursive tilings of the plane. ii. J. Symbolic Logic, 39(2), 286-294.
4. Gurevich, Yu. and Koriakov, I. (1972) A remark on Berger's paper on the domino problem. Siberian Math. J., 13, 459-463.
5. Allauzen, C. and Durand, B. (1996) Appendix A: tiling problems. pp. 407-420. In Boerger, E., Graedel, E. and Gurevich, Y. (eds), The Classical Decision Problem. Springer-Verlag.
6. Alexander Levitsky (2004) Aperiodicheskie zamoshcheniya s malym alfavitom (Aperiodic Tilings with small alphabet). In Russian. Master Thesis. Moscow State University.
7. Durand, B., Levin, L. A. and Shen, A. (2001) Complex tilings. In Proc. 33rd Annual ACM Symp. on Theory of Computing, Heraklion, Crete, Greece. July 6-8, pp. 732-739. ACM.
8. Gacs, P. (2001) Reliable cellular automata with self-organization. J. Stat. Phys., 103(1,2), 45-267. Available at http://www.arxiv.org/abs/ math.PR/0003117.