Halting Problem for One-State Turing Machines

Yannick Saouter 1
1 API - Parallel VLSI Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In [1], Turing has established the well-known result of the indecidability of the general halting problem of Turing machines. It is also well known that there exists entire classes of Turing machines whose halting is decidable (machines operating on an alphabet of one symbol, machines with finite tapes etc ...). In this article we are paying attention on Turing machines with a single state for which we prove that the halting is decidable. The interest of this problème is that it settles exactly with other works the limit between decidable and undecidable in regard of the number of internal states of the machine.
Type de document :
[Research Report] RR-2577, INRIA. 1995
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:32:09
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:05:10



  • HAL Id : inria-00074105, version 1


Yannick Saouter. Halting Problem for One-State Turing Machines. [Research Report] RR-2577, INRIA. 1995. 〈inria-00074105〉



Consultations de la notice


Téléchargements de fichiers