论文信息 - P01\it \Pi^0_1 Sets and Tilings

P01\it \Pi^0_1 Sets and Tilings

In this paper, we prove that given any \(\it \Pi^0_1\) subset P of {0,1}ℕ there is a tileset τ with a countable set of configurations C such that P is recursively homeomorphic to C ∖ U where U is a computable set of configurations. As a consequence, if P is countable, this tileset has the exact same set of Turing degrees.

Pascal Vanier | Emmanuel Jeandel

[1] A. Kechris. Classical descriptive set theory , 1987 .

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

[3] Douglas A. Cenzer,et al. Effective Symbolic Dynamics , 2008, CCA.

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

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

[6] Bruno Durand,et al. Structural aspects of tilings , 2008, STACS.

[7] Douglas A. Cenzer,et al. Computability of Countable Subshifts , 2010, CiE.

[8] Douglas A. Cenzer,et al. Computable symbolic dynamics , 2008, Math. Log. Q..

[9] Jeffrey B. Remmel,et al. Chapter 13 Π10 classes in mathematics , 1998 .

[10] Hao Wang. Proving theorems by pattern recognition — II , 1961 .

[11] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[12] Fernando Ferreira,et al. Programs, Proofs, Processes , 2012, Theory of Computing Systems.

[13] S. G. Simpson. Medvedev degrees of two-dimensional subshifts of finite type , 2012, Ergodic Theory and Dynamical Systems.

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

[15] S. G. Simpson. MASS PROBLEMS ASSOCIATED WITH EFFECTIVELY CLOSED SETS , 2011 .

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