Complex tilings

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 732-739

  Durand, Bruno ^a   Levin, Leonid ^b   Shen, Alexander ^c  

^a UNIVERSITÉ DE PROVENCE   (France)

^b BOSTON UNIVERSITY   (United States)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Kolmogorov complexity; Recursion theory; Tilings

Indexed keywords

COMPUTATIONAL COMPLEXITY; RECURSIVE FUNCTIONS; THEOREM PROVING; TOPOLOGY;

COMPLEX TILINGS;

SET THEORY;

EID: 0034832949     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380880     Document Type: Conference Paper

References (18)

1. Appendix A: "Tiling problems"
2. The undecidability of the domino problem
3. Tilings: Recursivity and regularity
4. Tilings and quasiperiodicity
5. Average case completeness
6. A remark on Berger's paper on the domino problem
7. Nonrecursive tilings of the plane. I
8. Average case complete problems
9. Complexity of solvable cases of the decision problem for the predicate calculus
10. Nonrecursive tilings of the plane, II
11. Undecidability and nonperiodicity for tilings of the plane
12. Proving theorems by pattern recognition II
13. Dominoes and the ∀∃∀-case of the decision problem