HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

Contributor : Pascal Vanier Connect in order to contact the contributor
Submitted on : Wednesday, September 17, 2014 - 9:14:33 AM
Last modification on : Wednesday, November 3, 2021 - 9:20:41 AM
Long-term archiving on: : Thursday, December 18, 2014 - 10:16:32 AM


Files produced by the author(s)




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. ⟨10.1007/978-3-319-58747-9_15⟩. ⟨hal-01058198v4⟩



Record views


Files downloads