Autosolvability of halting problem instances for instruction sequences

We position Turing's result regarding the undecidability of the halting problem as a result about programs rather than machines. The mere requirement that a program of a certain kind must solve the halting problem for all programs of that kind leads to a contradiction in the case of a recent unsolvability result regarding the halting problem for programs. In this paper, we investigate this autosolvability requirement in a setting in which programs take the form of instruction sequences.

[1]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[2]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[3]  Donald Sannella,et al.  Algebraic Preliminaries , 1999, Algebraic Foundations of Systems Specification.

[4]  Jan A. Bergstra,et al.  Execution architectures for program algebra , 2004, J. Appl. Log..

[5]  Jan A. Bergstra,et al.  Functional units for natural numbers , 2009, ArXiv.

[6]  Jan A. Bergstra,et al.  A Thread Algebra with Multi-level Strategic Interleaving , 2005, CiE.

[7]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Jan A. Bergstra,et al.  Program algebra with a jump-shift instruction , 2007, J. Appl. Log..