zbMATH — the first resource for mathematics

Nonrecursive tilings of the plane. I. (English) Zbl 0299.02054

03D99 Computability and recursion theory
03B25 Decidability of theories and sets of sentences
03D10 Turing machines and related notions
05B45 Combinatorial aspects of tessellation and tiling problems
Full Text: DOI
[1] Fundamenta Mathematica 43 pp 125– (1955)
[2] classes and Boolean combinations of recursively enumerable sets 39 pp 95– (1974)
[3] Theory of models pp 132– (1965)
[4] Memoirs of the American Mathematical Society pp 72– (1966)
[5] Nonrecursive tilings of the plane 39 pp 286– (1974)
[6] Theory of recursive functions and effective computability (1967) · Zbl 0183.01401
[7] DOI: 10.1007/BF01418780 · Zbl 0197.46801 · doi:10.1007/BF01418780
[8] Trial and error predicates and the solution to a problem of Mostowski 30 pp 49– (1965)
[9] DOI: 10.1002/j.1538-7305.1961.tb03975.x · doi:10.1002/j.1538-7305.1961.tb03975.x
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.