Quasiperiodicity and Non-computability in Tilings

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.

[1]  Moni Naor,et al.  Theory and Applications of Models of Computation , 2015, Lecture Notes in Computer Science.

[2]  Nicolas Ollinger.  Two-by-Two Substitution Systems and the Undecidability of the Domino Problem , 2008, CiE.

[3]  Pascal Vanier,et al.  A note on Turing degree spectra of minimal subshifts , 2014, ArXiv.

[4]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[5]  William P. Hanf,et al.  Nonrecursive tilings of the plane. I , 1974, Journal of Symbolic Logic.

[6]  Alexander Shen,et al.  Fixed-point tile sets and their applications , 2009, J. Comput. Syst. Sci..

[7]  Pascal Vanier,et al.  Turing degrees of multidimensional SFTs , 2011, Theor. Comput. Sci..

[8]  Pascal Vanier,et al.  P01\it \Pi^0_1 Sets and Tilings , 2011, TAMC.

[9]  E. Jeandel,et al.  P 0 1 \it \Pi^0_1 Sets and Tilings. , 2011, TAMC 2011.

[10]  Bruno Durand.  Tilings and Quasiperiodicity , 1999, Theor. Comput. Sci..

[11]  Pascal Vanier,et al.  Turing Degree Spectra of Minimal Subshifts , 2017, CSR.

[12]  M. Hochman.  Upcrossing inequalities for stationary sequences and applications. , 2006, math/0608311.

[13]  R. Robinson.  Undecidability and nonperiodicity for tilings of the plane , 1971 .

[14]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[15]  Emmanuel Jeandel,et al.  Computing (or not) Quasi-periodicity Functions of Tilings , 2010, JAC.

[16]  Jarkko Kari,et al.  An Aperiodic Set of Wang Cubes , 1996, STACS.

[17]  Dale Myers,et al.  Nonrecursive tilings of the plane. II , 1974, Journal of Symbolic Logic.

[18]  Upcrossing inequalities for stationary sequences and applications to entropy and complexity , 2006 .

[19]  G. C. Shephard,et al.  Tilings and Patterns , 1990 .

[20]  L. Levitov.  Local rules for quasicrystals , 1988 .

[21]  Leonid A. Levin,et al.  Complex tilings , 2001, STOC '01.