@inproceedings{1e6e9c065dc8489485ea1aee0ad7c1d8,
title = "Turing degree spectra of minimal subshifts",
abstract = "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{\textquoteright}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.",
author = "Michael Hochman and Pascal Vanier",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 12th International Computer Science Symposium in Russia, CSR 2017 ; Conference date: 08-06-2017 Through 12-06-2017",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-58747-9\_15",
language = "English",
isbn = "9783319587462",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "154--161",
editor = "Pascal Weil",
booktitle = "Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings",
}