Some undecidable problems about the trace-subshift associated to a Turing machine - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

Some undecidable problems about the trace-subshift associated to a Turing machine

Abstract

We consider three problems related to dynamics of one-tape Turing machines: Existence of blocking configurations, surjectivity in the trace, and entropy positiveness. In order to address them, a reversible two-counter machine is simulated by a reversible Turing machine on the right side of its tape. By completing the machine in different ways, we prove that none of the former problems is decidable. In particular, the problems about blocking configurations and entropy are shown to be undecidable for the class of reversible Turing machines.
Fichier principal
Vignette du fichier
2700-9828-1-PB.pdf (576.43 Ko) Télécharger le fichier
Origin Explicit agreement for this submission
Loading...

Dates and versions

hal-01349052 , version 1 (26-07-2016)

Identifiers

Cite

Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés. Some undecidable problems about the trace-subshift associated to a Turing machine. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no.2 (2), pp.267-284. ⟨10.46298/dmtcs.2137⟩. ⟨hal-01349052⟩
116 View
1056 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More