Skip to main content

Undecidability of the surjectivity of the subshift associated to a turing machine

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Torres, R., Ollinger, N., & Gajardo, A. (2013). Undecidability of the surjectivity of the subshift associated to a turing machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7581 LNCS, pp. 44–56). Springer Verlag. https://doi.org/10.1007/978-3-642-36315-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free