In comp.theory olcott <NoOne@nowhere.com> wrote:
The x86utm operating system was created so that the halting problem
could be examined concretely in the high level language of C. H is a
function written in C that analyzes the x86 machine language execution
trace of other functions written in C. H recognizes simple cases of
infinite recursion and infinite loops. The conventional halting
problem proof counter-example template is shown to simply be an input
that does not halt.
H simulates its input with an x86 emulator until it determines that
its input would never halt. As soon as H recognizes that its input
would never halt it stops simulating this input and returns 0. For
inputs that do halt H acts exactly as if it was an x86 emulator and
simply runs its input to completion and then returns 1.
In computability theory, the halting problem is the problem of
determining, from a description of an arbitrary computer program
and an input, whether the program will finish running, or continue
to run forever. https://en.wikipedia.org/wiki/Halting_problem
Simulating partial halt decider H correctly decides that P(P) never
halts (V2)
If you wanted a truly honest debate about your "proof", you would make
the source code for H available, assuming it actually exists.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 366 |
Nodes: | 16 (2 / 14) |
Uptime: | 15:45:23 |
Calls: | 7,812 |
Files: | 12,927 |
Messages: | 5,766,124 |