• Re: Refuting the Peter Linz Halting Problem Proof --- Version(11) [ Why

    From olcott@21:1/5 to Dennis Bush on Sat Apr 16 21:17:51 2022
    XPost: comp.theory, sci.logic, sci.math

    On 4/16/2022 8:57 PM, Dennis Bush wrote:
    On Saturday, April 16, 2022 at 9:33:22 PM UTC-4, olcott wrote:
    On 4/16/2022 8:24 PM, Ben wrote:
    olcott <No...@NoWhere.com> writes:

    On 4/15/2022 5:10 PM, Ben wrote:
    olcott <No...@NoWhere.com> writes:

    On 4/15/2022 6:39 AM, Ben wrote:

    Anyway, you don't get to say what the correct answer is.

    Computer science says that...
    WHOOP! WHOOP! WHOOP! **wonky paraphrase alert**

    On 4/15/2022 10:02 AM, olcott wrote:
    Computer science says that any input to a halt decider that
    would never reach its own final state is non-halting.

    The above is the rest of the quote that you despicably removed.
    You are such a complete Jackass.

    I'll remember to keep the wonky paraphrase intact in future. I was not
    accusing you of lying about what "computer science" says, just of not
    understanding what it says. This is true, I'm sure, of all your "so
    what you are saying is..." catastrophes. Hanlon's Razor and all that.

    The key point is that because the input to H(P,P) is non-halting
    H(P,P)==false is necessary correct.
    If I was wrong then the correct simulation of the 27 bytes of machine
    code at machine address [000009d6] by H would show some correct
    execution trace from machine address [000009d6] ending at machine
    address [000009f0].

    _P()
    [000009d6](01) 55 push ebp
    [000009d7](02) 8bec mov ebp,esp
    [000009d9](03) 8b4508 mov eax,[ebp+08]
    [000009dc](01) 50 push eax // push P
    [000009dd](03) 8b4d08 mov ecx,[ebp+08]
    [000009e0](01) 51 push ecx // push P
    [000009e1](05) e840feffff call 00000826 // call H
    [000009e6](03) 83c408 add esp,+08
    [000009e9](02) 85c0 test eax,eax
    [000009eb](02) 7402 jz 000009ef
    [000009ed](02) ebfe jmp 000009ed
    [000009ef](01) 5d pop ebp
    [000009f0](01) c3 ret // Final state
    Size in bytes:(0027) [000009f0]

    That everyone refuses this challenge proves that it is beyond their
    technical capacity or that they are liars.
    Halting problem undecidability and infinitely nested simulation (V5)

    https://www.researchgate.net/publication/359984584_Halting_problem_undecidability_and_infinitely_nested_simulation_V5

    You claim that because Ha(Pa,Pa) cannot simulate its input to a final state then it is correct to return false.

    By the same logic, because Ha3(N,5) cannot simulate its input to a final state then it is correct to return false.

    Agreed?

    I agreed that you dodged my challenge.
    I will stop responding until you meet my challenge.

    --
    Copyright 2022 Pete Olcott

    "Talent hits a target no one else can hit;
    Genius hits a target no one else can see."
    Arthur Schopenhauer

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