%0 Journal Article
%T Quasiperiodicity and non-computability in tilings
%A Bruno Durand
%A Andrei Romashchenko
%J Computer Science
%D 2015
%I arXiv
%X We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the fixed point construction; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any effectively closed set can be recursively transformed into a tile set so that the Turing degrees of the resulted tilings consists exactly of the upper cone based on the Turing degrees of the later.
%U http://arxiv.org/abs/1504.06130v3