Turing degrees of multidimensional subshifts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2013

Turing degrees of multidimensional subshifts

Abstract

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$ such that $P\times\ZZ^2$ is recursively homeomorphic to $X\setminus U$ where $U$ is a computable set of points. As a consequence, if $P$ contains a recursive member, $P$ and $X$ have the exact same set of Turing degrees. On the other hand, we prove that if $X$ contains only non-recursive members, some of its members always have different but comparable degrees. This gives a fairly complete study of Turing degrees of SFTs.
Fichier principal
Vignette du fichier
tcs-arxiv.pdf (1.05 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00613165 , version 1 (03-08-2011)
hal-00613165 , version 2 (25-08-2011)
hal-00613165 , version 3 (01-06-2012)

Identifiers

Cite

Emmanuel Jeandel, Pascal Vanier. Turing degrees of multidimensional subshifts. Theoretical Computer Science, 2013, http://dx.doi.org/10.1016/j.tcs.2012.08.027. ⟨10.1016/j.tcs.2012.08.027⟩. ⟨hal-00613165v3⟩
245 View
547 Download

Altmetric

Share

Gmail Facebook X LinkedIn More