Some undecidable problems about the trace-subshift associated to a Turing machine Article - Décembre 2015

Anahí Gajardo, Nicolas Ollinger, Rodrigo Torres-Avilés

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, décembre 2015, pp. 267-284. ISSN 1462-7264

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.

Voir la notice complète sur HAL

Actualités