Autosolvability of halting problem instances for instruction sequences

Details Autosolvability of halting problem instances for instruction sequences Autosolvability of halting problem instances for instruction sequences

2009-11-26

arxiv.org/abs/0911.5018v3

Computer Science

Logic in Computer Science

18 pages; notational mistakes in tables 5 and 6 corrected; erroneous definition in last paragraph of page 11 corrected

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Autosolvability of halting problem instances for instruction sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Autosolvability of halting problem instances for instruction sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Autosolvability of halting problem instances for instruction sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116280