• Re: Hypothetical possibilities --- Completly incorrect Proof

    From Richard Damon@21:1/5 to olcott on Thu Aug 1 19:33:30 2024
    On 8/1/24 12:32 PM, olcott wrote:
    On 8/1/2024 11:11 AM, joes wrote:
    Am Thu, 01 Aug 2024 09:30:00 -0500 schrieb olcott:
    On 8/1/2024 9:23 AM, Fred. Zwarts wrote:
    Op 01.aug.2024 om 15:29 schreef olcott:
    On 8/1/2024 8:12 AM, Fred. Zwarts wrote:
    Op 01.aug.2024 om 14:20 schreef olcott:
    On 8/1/2024 3:10 AM, Fred. Zwarts wrote:
    Op 31.jul.2024 om 23:23 schreef olcott:
    On 7/31/2024 3:01 PM, Fred. Zwarts wrote:
    Op 31.jul.2024 om 17:14 schreef olcott:
    On 7/31/2024 3:44 AM, Fred. Zwarts wrote:
    Op 31.jul.2024 om 06:09 schreef olcott:

    The trace stops and hides what happens when 000015d2 is called.
    Olcott is hiding the conditional branch instructions in the
    recursion.
    These next lines conclusively prove that DDD is being correctly
    emulated by HHH after DDD calls HHH(DDD).
    It also shows that HHH when simulating itself, does not reach the end
    of its own simulation.
    If you weren't a clueless wonder you would understand that DDD correctly >>> emulated by HHH including HHH emulating itself emulated DDD has no end
    of correct emulation.

    It does if the simulated HHH aborts, but its simulating copy preempts
    that. Indeed, it has no choice, but if it didn't abort, the simulation
    wouldn't abort either. Therefore it can't simulate itself.


    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
        If simulating halt decider H correctly simulates its input D
        until H correctly determines that its simulated D would never
        stop running unless aborted then

        H can abort its simulation of D and correctly report that D
        specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    I spent two years carefully composing the above before I even
    asked professor Sipser to review it.

    DDD is correctly emulated by HHH until HHH sees the same
    never ending pattern that anyone else can see.


    Edcept that HHH never sees that pattern, as any pattern that it thinks
    is never-ending makes that pattern halting, based on the actual correct emulation of DDD past the point that HHH gives up.

    You HHH makes the mistake of not actually doing what it is supposed to
    do. The sorry aspect is you have been shown the method that could be
    used to get the correct answer for this case, but refuse to use it,
    making you answer all the more wrong.

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