The relationship between word complexity and computational complexity in subshifts - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

The relationship between word complexity and computational complexity in subshifts

Ronnie Pavlov
  • Fonction : Auteur
  • PersonId : 1043869

Résumé

We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing spectrum can be realized via a subshift of linear complexity if and only if it consists of the union of a finite set and a finite number of cones, that a Turing spectrum can be realized via a subshift of exponential complexity (i.e. positive entropy) if and only if it contains a cone, and that every Turing spectrum which either contains degree 0 or is a union of cones is realizable by subshifts with a wide range of 'intermediate' complexity growth rates between linear and exponential.
Fichier principal
Vignette du fichier
draft.pdf (308.05 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02063174 , version 1 (10-03-2019)

Identifiants

Citer

Ronnie Pavlov, Pascal Vanier. The relationship between word complexity and computational complexity in subshifts. 2019. ⟨hal-02063174⟩

Collections

LACL UPEC TDS-MACS
110 Consultations
182 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More