XPost: comp.theory, comp.software-eng, sci.math.symbolic

On 8/7/2021 7:14 AM, Alan Mackenzie wrote:

In comp.theory olcott <[email protected]> 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.

What the source-code does and how it does it can be fully proven
entirely on the basis of what has been provided.

That people insist on seeing the source-code only proves that they are
not paying enough attention.

The nested simulated calls never return whether or not they are aborted.
The infinitely nested simulations never stop unless they are aborted.

_P()
[00000d02](01) 55 push ebp
[00000d03](02) 8bec mov ebp,esp
[00000d05](03) 8b4508 mov eax,[ebp+08]
[00000d08](01) 50 push eax // push P
[00000d09](03) 8b4d08 mov ecx,[ebp+08]
[00000d0c](01) 51 push ecx // push P
[00000d0d](05) e870feffff call 00000b82 // call H that emulates P [00000d12](03) 83c408 add esp,+08
[00000d15](02) 85c0 test eax,eax
[00000d17](02) 7402 jz 00000d1b
[00000d19](02) ebfe jmp 00000d19
[00000d1b](01) 5d pop ebp
[00000d1c](01) c3 ret
Size in bytes:(0027) [00000d1c]

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation


--
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre
minds." Einstein

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)