Nonrecursive tilings of the plane. I
From MaRDI portal
Publication:4053638
DOI10.2307/2272640zbMath0299.02054OpenAlexW2043620450MaRDI QIDQ4053638
Publication date: 1974
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272640
Decidability of theories and sets of sentences (03B25) Combinatorial aspects of tessellation and tiling problems (05B45) Computability and recursion theory (03D99) Turing machines and related notions (03D10)
Related Items (19)
Turing degree spectra of minimal subshifts ⋮ Simulation of effective subshifts by two-dimensional subshifts of finite type ⋮ Quasiperiodicity and Non-computability in Tilings ⋮ Turing degrees of multidimensional SFTs ⋮ A Topological Study of Tilings ⋮ Complex tilings ⋮ Nonrecursive tilings of the plane. II ⋮ Fixed-point tile sets and their applications ⋮ The Undecidability of the Domino Problem ⋮ $\it \Pi^0_1$ Sets and Tilings ⋮ The domino problem of the hyperbolic plane is undecidable ⋮ Medvedev degrees of two-dimensional subshifts of finite type ⋮ Topological dynamics of cellular automata: dimension matters ⋮ Undecidable tiling problems in the hyperbolic plane ⋮ Tilings: simulation and universality ⋮ The expressiveness of quasiperiodic and minimal shifts of finite type ⋮ Putnam’s Theorem on the Complexity of Models ⋮ Two-dimensional partial orderings: Undecidability ⋮ A generalization of the simulation theorem for semidirect products
Cites Work
This page was built for publication: Nonrecursive tilings of the plane. I
