Conference Papers Year : 2017

Turing degree spectra of minimal subshifts

Michael Hochman
  • Function : Author
  • PersonId : 959811

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.
Fichier principal
Vignette du fichier
minimalturdeg-arxiv.pdf (121.12 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01058198 , version 1 (26-08-2014)
hal-01058198 , version 2 (27-08-2014)
hal-01058198 , version 3 (06-09-2014)
hal-01058198 , version 4 (17-09-2014)

Identifiers

Cite

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⟩

Collections

LACL UPEC TDS-MACS
390 View
366 Download

Altmetric

Share

More