Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine - Archive ouverte HAL Access content directly
Conference Papers Lecture Notes in Computer Science Year : 2013

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

Abstract

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
unsusu.pdf (147.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
91 View
320 Download

Altmetric

Share

Gmail Facebook X LinkedIn More