Turing degree spectra of minimal subshifts

Abstract : Subshifts are shift invariant closed subsets of $\Sigma^{\mathbb{Z}^d}$ , minimal subshifts are subshifts in which all points contain the same patterns. It has been proved by Jeandel and Vanier that the Turing degree spectra of non-periodic minimal subshifts always contain the cone of Turing degrees above any of its degree. It was however not known whether each minimal subshift's spectrum was formed of exactly one cone or not. We construct inductively a minimal subshift whose spectrum consists of an uncountable number of cones with disjoint base.
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01058198
Contributor : Pascal Vanier <>
Submitted on : Wednesday, September 17, 2014 - 9:14:33 AM
Last modification on : Wednesday, December 19, 2018 - 3:50:03 PM
Document(s) archivé(s) le : Thursday, December 18, 2014 - 10:16:32 AM

Files

minimalturdeg-arxiv.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michael Hochman, Pascal Vanier. Turing degree spectra of minimal subshifts. Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, Jun 2017, Kazan, Russia. 2017, 〈10.1007/978-3-319-58747-9_15〉. 〈hal-01058198v4〉

Share

Metrics

Record views

316

Files downloads

93