Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2013

Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine

Résumé

We consider Turing machines (TM) from a dynamical system point of view, and in this context, we associate a subshift by taking the sequence of symbols and states that the head has at each instant. Taking a subshift that select only a part of the state of a system is a classical technic in dynamical systems that plays a central role in their analysis. Surjectivity of Turing machines is equivalent to their reversibility and it can be simply identified from the machine rule. Nevertheless, the associated subshift can be surjective even if the machine is not, and the property results to be undecidable in the symbolic system.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
unsusu.pdf (147.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00980369 , version 1 (17-04-2014)

Identifiants

Citer

Rodrigo Torres, Nicolas Ollinger, Anahi Gajardo. Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine. RC 2012, Jul 2012, Copenhague, Denmark. pp.44-56, ⟨10.1007/978-3-642-36315-3_4⟩. ⟨hal-00980369⟩
90 Consultations
320 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More