Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T03:20:57.263Z Has data issue: false hasContentIssue false

The unsolvability of the uniform halting problem for two stateTuring machines

Published online by Cambridge University Press:  12 March 2014

Gabor T. Herman*
Affiliation:
IBM (United Kingdom), London

Extract

The uniform halting problem (UH) can be stated as follows:

Give a decision procedure which for any given Turing machine (TM) willdecide whether or not it has an immortal instantaneous description (ID).

An ID is called immortal if it has no terminal successor. As it is generallythe case in the literature (see e.g. Minsky [4, p. 118]) we assume that inan ID the tape must be blank except for some finite number of squares. If weremove this restriction the UH becomes the immortality problem (IP).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1969

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable