Subshifts are shift invariant closed subsets of ΣZd, with Σ a finite alphabet. 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 degrees. It was how-ever 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 incom-parable bases.
|Original language||American English|
|Title of host publication||Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings|
|Number of pages||8|
|State||Published - 2017|
|Event||12th International Computer Science Symposium in Russia, CSR 2017 - Kazan, Russian Federation|
Duration: 8 Jun 2017 → 12 Jun 2017
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||12th International Computer Science Symposium in Russia, CSR 2017|
|Period||8/06/17 → 12/06/17|
Bibliographical notePublisher Copyright:
© Springer International Publishing AG 2017.