Turing degree spectra of minimal subshifts

Michael Hochman 1 Pascal Vanier 2
1 Einstein Institute of Mathematics
2 LACL - Laboratoire d'Algorithmique Complexité et Logique
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.
Keywords : Turing degree subshift minimal subshift spectra cone
Type de document :
Communication dans un congrès
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〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger
https://hal.archives-ouvertes.fr/hal-01058198
Contributeur : Pascal Vanier <>
Soumis le : mercredi 17 septembre 2014 - 09:14:33
Dernière modification le : mercredi 19 décembre 2018 - 15:50:03
Document(s) archivé(s) le : jeudi 18 décembre 2014 - 10:16:32

Fichiers

minimalturdeg-arxiv.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

LACL | INSMI | UPEC-UPEM | TDS-MACS

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〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

312

Téléchargements de fichiers

82

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD