• Re: DDD emulated by HHH diverges from DDD emulated by HHH1--- BEST ONE

    From Richard Damon@21:1/5 to olcott on Fri Jun 6 22:02:14 2025
    XPost: comp.theory, sci.logic

    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out your mistake. >>>>>>>>
    See below, which shows that the simulations performed by HHH and >>>>>>>> HHH1 are identical up to the point that HHH aborts, as you have >>>>>>>> agreed on the record.



    False.  The correct trace is the one I posted, which shows all
    levels of emulation performed by HHH and HHH1.  See the
    corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/ emulations?  It
    is perfectly sensible to include nested emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side.
    A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of these
    traces, the hierarchy can be "flattened" into one stream of nested
    simulations. You do this yourself every time you present one of your
    nested simulation traces.  Such a trace should include a simulation
    depth (or equivalent) for each entry.

    Two nested simulation traces can easily be presented side-by-side for
    comparisson.  You are just trying to divert attention from your own
    failings to properly understand the requirements.


    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH
    [00002183] push ebp               [00002183] push ebp [00002184] mov ebp,esp            [00002184] mov ebp,esp [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH
    *HHH1 emulates DDD once then HHH emulates DDD once, these match*

    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*

    Because the correct emulation of the input doesn't call for this to be
    done, and the identity of the emulator doesn't affect the defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct emulation,
    and this has been pointed out, just shows that all of the "data" is just
    lies.

    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*

    DDD emulated by HHH emulating itself
    [00002183] push ebp      ;
    [00002184] mov ebp,esp   ;
    [00002186] push 00002183 ; DDD
    [0000218b] call 000015c3 ; HHH =================================================================

    _DDD()
    [00002183] 55             push ebp
    [00002184] 8bec           mov ebp,esp
    [00002186] 6883210000     push 00002183 ; push DDD
    [0000218b] e833f4ffff     call 000015c3 ; call HHH
    [00002190] 83c404         add esp,+04
    [00002193] 5d             pop ebp
    [00002194] c3             ret
    Size in bytes:(0018) [00002194]

    _main()
    [000021a3] 55             push ebp
    [000021a4] 8bec           mov ebp,esp
    [000021a6] 6883210000     push 00002183 ; push DDD
    [000021ab] e843f3ffff     call 000014f3 ; call HHH1
    [000021b0] 83c404         add esp,+04
    [000021b3] 33c0           xor eax,eax
    [000021b5] 5d             pop ebp
    [000021b6] c3             ret
    Size in bytes:(0020) [000021b6]

     machine   stack     stack     machine    assembly
     address   address   data      code       language
     ========  ========  ========  ========== =============
    <main is executed>
    [000021a3][0010382d][00000000] 55         push ebp      ; main() [000021a4][0010382d][00000000] 8bec       mov ebp,esp   ; main() [000021a6][00103829][00002183] 6883210000 push 00002183 ; push DDD [000021ab][00103825][000021b0] e843f3ffff call 000014f3 ; call HHH1
    </main is executed>

    New slave_stack at:1038d1
    Begin Local Halt Decider Simulation   Execution Trace Stored at:1138d9

    <DDD emulated by HHH1>
    [00002183][001138c9][001138cd] 55         push ebp      ; DDD of HHH1
    [00002184][001138c9][001138cd] 8bec       mov ebp,esp   ; DDD of HHH1 [00002186][001138c5][00002183] 6883210000 push 00002183 ; push DDD [0000218b][001138c1][00002190] e833f4ffff call 000015c3 ; call HHH
    </DDD emulated by HHH1>

    New slave_stack at:14e2f9
    Begin Local Halt Decider Simulation   Execution Trace Stored at:15e301

    <DDD emulated by HHH>
    [00002183][0015e2f1][0015e2f5] 55         push ebp      ; DDD of HHH[0]
    [00002184][0015e2f1][0015e2f5] 8bec       mov ebp,esp   ; DDD of HHH[0]
    [00002186][0015e2ed][00002183] 6883210000 push 00002183 ; push DDD [0000218b][0015e2e9][00002190] e833f4ffff call 000015c3 ; call HHH
    <DDD emulated by HHH>

    New slave_stack at:198d21  DDD emulated by HHH
    *This is the beginning of the divergence of the behavior*
    *HHH is emulating itself emulating DDD, HHH1 never does that*

    <DDD emulated by HHH emulating itself>
    [00002183][001a8d19][001a8d1d] 55         push ebp      ; DDD of HHH[1]
    [00002184][001a8d19][001a8d1d] 8bec       mov ebp,esp   ; DDD of HHH[1]
    [00002186][001a8d15][00002183] 6883210000 push 00002183 ; push DDD [0000218b][001a8d11][00002190] e833f4ffff call 000015c3 ; call HHH
    </DDD emulated by HHH emulating itself>

    Local Halt Decider: Infinite Recursion Detected Simulation Stopped
    HHH returns to caller

    <DDD emulated by HHH1>
    [00002190][001138c9][001138cd] 83c404     add esp,+04 ; DDD of HHH1 [00002193][001138cd][000015a8] 5d         pop ebp     ; DDD of HHH1
    [00002194][001138d1][0003a980] c3         ret         ; DDD of HHH1
    </DDD emulated by HHH1>

    <main is executed>
    [000021b0][0010382d][00000000] 83c404     add esp,+04 ; main() [000021b3][0010382d][00000000] 33c0       xor eax,eax ; main() [000021b5][00103831][00000018] 5d         pop ebp     ; main() [000021b6][00103835][00000000] c3         ret         ; main()
    </main is executed>
    Number of Instructions Executed(352831) == 5266 Pages



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jun 7 07:18:20 2025
    XPost: comp.theory, sci.logic

    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out your >>>>>>>>>>> mistake.

    See below, which shows that the simulations performed by HHH >>>>>>>>>> and HHH1 are identical up to the point that HHH aborts, as you >>>>>>>>>> have agreed on the record.



    False.  The correct trace is the one I posted, which shows all >>>>>>>> levels of emulation performed by HHH and HHH1.  See the
    corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/ emulations?
    It is perfectly sensible to include nested emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side.
    A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of these
    traces, the hierarchy can be "flattened" into one stream of nested
    simulations. You do this yourself every time you present one of your
    nested simulation traces.  Such a trace should include a simulation
    depth (or equivalent) for each entry.

    Two nested simulation traces can easily be presented side-by-side
    for comparisson.  You are just trying to divert attention from your
    own failings to properly understand the requirements.


    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH
    [00002183] push ebp               [00002183] push ebp
    [00002184] mov ebp,esp            [00002184] mov ebp,esp
    [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD
    [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH
    *HHH1 emulates DDD once then HHH emulates DDD once, these match*

    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*

    Because the correct emulation of the input doesn't call for this to be
    done, and the identity of the emulator doesn't affect the defintion of
    a correct emulation.

    That fact that NONE of your traces actually show a correct emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the traces shown
    are not correct.

    \Just because YOU are to stupid to make sense of the long report,
    doesn't mean that it isn't factual, and NEEDED to make your point.

    All you are doing is saying that logic needs to allow LYING for you to understand it, likely because you have an inherent misunderstanding
    about the nature of how truth and logic work.

    Note, you can't even seem to keep seperate the trace of the execution of
    the outer HHH from the trace that it sees from its emulation, which is
    why the output is so long.

    The problem is that you just don't understand what you are doing, and
    are just hacking at a program you jury-rigged from an good open-source
    prject that you hacked up to build your "proof" from, by figuing out how
    to "edit" its output to show what you want.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Jun 7 19:38:35 2025
    XPost: comp.theory, sci.logic

    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out your >>>>>>>>>>>>> mistake.

    See below, which shows that the simulations performed by HHH >>>>>>>>>>>> and HHH1 are identical up to the point that HHH aborts, as >>>>>>>>>>>> you have agreed on the record.



    False.  The correct trace is the one I posted, which shows all >>>>>>>>>> levels of emulation performed by HHH and HHH1.  See the
    corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/ emulations? >>>>>>>> It is perfectly sensible to include nested emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side.
    A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of these
    traces, the hierarchy can be "flattened" into one stream of nested >>>>>> simulations. You do this yourself every time you present one of
    your nested simulation traces.  Such a trace should include a
    simulation depth (or equivalent) for each entry.

    Two nested simulation traces can easily be presented side-by-side
    for comparisson.  You are just trying to divert attention from
    your own failings to properly understand the requirements.


    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH
    [00002183] push ebp               [00002183] push ebp
    [00002184] mov ebp,esp            [00002184] mov ebp,esp
    [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD
    [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH
    *HHH1 emulates DDD once then HHH emulates DDD once, these match*

    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*

    Because the correct emulation of the input doesn't call for this to
    be done, and the identity of the emulator doesn't affect the
    defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the traces
    shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a partial simulation not reaching a final state doesn't establish non-halting.

    non-halting is only established by the fact that some simulation of that
    input (not necessarily by the decider) must not stop even after an
    unbounded number of steps.

    But that fact that there are two different computations going on "at
    once' seems to be beyound your ability to understand.

    You are just showing you don't understand the meaning of the words you
    are using, and just LYING about what they mean.


    \Just because YOU are to stupid to make sense of the long report,
    doesn't mean that it isn't factual, and NEEDED to make your point.


    As soon as I detect the first fatal error I quit reading.

    And since you never actually proint out that error, I guess you are
    admitting that you mind has gotten stuck in an infinte loop trying to
    solve your problem.

    As I have said, before you can just assert a definition, you need to
    show it from a relaive source, which isn't you.

    All you are doing is showing that the only ground you have for your
    claims are that "You say so" and thus by your own rules, you can't be
    talking truth, as truth only comes from the ESTABLISHED truth makers of
    the system, and you can't just make them up.


    All you are doing is saying that logic needs to allow LYING for you to
    understand it, likely because you have an inherent misunderstanding
    about the nature of how truth and logic work.

    Note, you can't even seem to keep seperate the trace of the execution
    of the outer HHH from the trace that it sees from its emulation, which
    is why the output is so long.


    There is no need for the 5226 pages of the traces of
    HHH1 and HHH. As soon as main() calls HHH1(DDD) we can
    know that HHH1(DDD) has been called.

    SO?

    The problem is we don't need a trace of HHH or HHH1, we need the
    complete trace of what they SEE in their emulation.




    The problem is that you just don't understand what you are doing, and
    are just hacking at a program you jury-rigged from an good open-source
    prject that you hacked up to build your "proof" from, by figuing out
    how to "edit" its output to show what you want.

    Whenever you try to get specific then it is obvious
    that all you have is incoherent gibberish.


    Nope, it seems that you comprehension is lacking because you don't
    understand the words of the field.

    It seems you have installed a reality filter into your mind, and
    anything that disagrees with what you have decided you want to be
    "raality" no matter how much of a fantasy, your filter just filters it out.

    Maybe someone should contact your local athorities and point out that
    there is someone with a lack of contact with reality in there area, and evaluate if you are a danger to you or society.

    They might find you to be harmless, but I am not sure.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jun 8 07:11:37 2025
    XPost: comp.theory, sci.logic

    On 6/7/25 7:54 PM, olcott wrote:
    On 6/7/2025 6:38 PM, Richard Damon wrote:
    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out your >>>>>>>>>>>>>>> mistake.

    See below, which shows that the simulations performed by >>>>>>>>>>>>>> HHH and HHH1 are identical up to the point that HHH >>>>>>>>>>>>>> aborts, as you have agreed on the record.



    False.  The correct trace is the one I posted, which shows >>>>>>>>>>>> all levels of emulation performed by HHH and HHH1.  See the >>>>>>>>>>>> corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/
    emulations? It is perfectly sensible to include nested
    emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side.
    A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of these >>>>>>>> traces, the hierarchy can be "flattened" into one stream of
    nested simulations. You do this yourself every time you present >>>>>>>> one of your nested simulation traces.  Such a trace should
    include a simulation depth (or equivalent) for each entry.

    Two nested simulation traces can easily be presented side-by-
    side for comparisson.  You are just trying to divert attention >>>>>>>> from your own failings to properly understand the requirements. >>>>>>>>

    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH >>>>>>> [00002183] push ebp               [00002183] push ebp >>>>>>> [00002184] mov ebp,esp            [00002184] mov ebp,esp >>>>>>> [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD >>>>>>> [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH >>>>>>> *HHH1 emulates DDD once then HHH emulates DDD once, these match* >>>>>>>
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS*

    Because the correct emulation of the input doesn't call for this
    to be done, and the identity of the emulator doesn't affect the
    defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct emulation, >>>>>
    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the traces
    shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a
    partial simulation not reaching a final state doesn't establish non-
    halting.


    *CAN'T POSSIBLY REACH A FINAL STATE DOES ESTABLISH NOT HALTING*


    Right, but the subject of said proposition is the MACHINE, not a partial simulation of said machine.

    For simulations to be used to show non-halting, you must show that even
    after an unbounded number of steps simulated, it never reaches a final
    state.

    The finite number N steps that any of your HHH that reports non-halting
    does, is NOT a "Unbounded number", and thus your HHH is not a source of
    truth for that attribute.

    Also, Halting (or Non-Halting) is only a property of PROGRAMS, something
    you admit that you DDD is not, so it is just a categorical error to
    talki about if your DDD halts or not.

    Sorry, but you are just proving you stupidity.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Sun Jun 8 19:17:10 2025
    XPost: comp.theory, sci.logic

    Op 08.jun.2025 om 18:41 schreef olcott:
    On 6/8/2025 6:11 AM, Richard Damon wrote:
    On 6/7/25 7:54 PM, olcott wrote:
    On 6/7/2025 6:38 PM, Richard Damon wrote:
    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out >>>>>>>>>>>>>>>>> your mistake.

    See below, which shows that the simulations performed by >>>>>>>>>>>>>>>> HHH and HHH1 are identical up to the point that HHH >>>>>>>>>>>>>>>> aborts, as you have agreed on the record.



    False.  The correct trace is the one I posted, which shows >>>>>>>>>>>>>> all levels of emulation performed by HHH and HHH1.  See >>>>>>>>>>>>>> the corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/
    emulations? It is perfectly sensible to include nested >>>>>>>>>>>> emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side.
    A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of >>>>>>>>>> these traces, the hierarchy can be "flattened" into one stream >>>>>>>>>> of nested simulations. You do this yourself every time you >>>>>>>>>> present one of your nested simulation traces.  Such a trace >>>>>>>>>> should include a simulation depth (or equivalent) for each entry. >>>>>>>>>>
    Two nested simulation traces can easily be presented side-by- >>>>>>>>>> side for comparisson.  You are just trying to divert attention >>>>>>>>>> from your own failings to properly understand the requirements. >>>>>>>>>>

    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH >>>>>>>>> [00002183] push ebp               [00002183] push ebp >>>>>>>>> [00002184] mov ebp,esp            [00002184] mov ebp,esp >>>>>>>>> [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD >>>>>>>>> [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH >>>>>>>>> *HHH1 emulates DDD once then HHH emulates DDD once, these match* >>>>>>>>>
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS* >>>>>>>>
    Because the correct emulation of the input doesn't call for this >>>>>>>> to be done, and the identity of the emulator doesn't affect the >>>>>>>> defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct
    emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the traces
    shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a
    partial simulation not reaching a final state doesn't establish non-
    halting.


    *CAN'T POSSIBLY REACH A FINAL STATE DOES ESTABLISH NOT HALTING*


    Right, but the subject of said proposition is the MACHINE, not a
    partial simulation of said machine.

    For simulations to be used to show non-halting, you must show that
    even after an unbounded number of steps simulated, it never reaches a
    final state.


    We have been over this too many times, either you are
    a liar or you have severe brain damage. DDD simulated
    by HHH matches a non-halting behavior pattern after
    two complete simulations of its first four steps.
    No, it does not. It decides too early. It needs three cycles to see the
    halting behaviour.
    It needs to simulate more that the first four steps. It also needs to
    count the conditional branch instructions in HHH.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jun 8 13:27:58 2025
    XPost: comp.theory, sci.logic

    On 6/8/25 12:41 PM, olcott wrote:
    On 6/8/2025 6:11 AM, Richard Damon wrote:
    On 6/7/25 7:54 PM, olcott wrote:
    On 6/7/2025 6:38 PM, Richard Damon wrote:
    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out >>>>>>>>>>>>>>>>> your mistake.

    See below, which shows that the simulations performed by >>>>>>>>>>>>>>>> HHH and HHH1 are identical up to the point that HHH >>>>>>>>>>>>>>>> aborts, as you have agreed on the record.



    False.  The correct trace is the one I posted, which shows >>>>>>>>>>>>>> all levels of emulation performed by HHH and HHH1.  See >>>>>>>>>>>>>> the corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/
    emulations? It is perfectly sensible to include nested >>>>>>>>>>>> emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side.
    A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of >>>>>>>>>> these traces, the hierarchy can be "flattened" into one stream >>>>>>>>>> of nested simulations. You do this yourself every time you >>>>>>>>>> present one of your nested simulation traces.  Such a trace >>>>>>>>>> should include a simulation depth (or equivalent) for each entry. >>>>>>>>>>
    Two nested simulation traces can easily be presented side-by- >>>>>>>>>> side for comparisson.  You are just trying to divert attention >>>>>>>>>> from your own failings to properly understand the requirements. >>>>>>>>>>

    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH >>>>>>>>> [00002183] push ebp               [00002183] push ebp >>>>>>>>> [00002184] mov ebp,esp            [00002184] mov ebp,esp >>>>>>>>> [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD >>>>>>>>> [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH >>>>>>>>> *HHH1 emulates DDD once then HHH emulates DDD once, these match* >>>>>>>>>
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS* >>>>>>>>
    Because the correct emulation of the input doesn't call for this >>>>>>>> to be done, and the identity of the emulator doesn't affect the >>>>>>>> defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct
    emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the traces
    shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a
    partial simulation not reaching a final state doesn't establish non-
    halting.


    *CAN'T POSSIBLY REACH A FINAL STATE DOES ESTABLISH NOT HALTING*


    Right, but the subject of said proposition is the MACHINE, not a
    partial simulation of said machine.

    For simulations to be used to show non-halting, you must show that
    even after an unbounded number of steps simulated, it never reaches a
    final state.


    We have been over this too many times, either you are
    a liar or you have severe brain damage. DDD simulated
    by HHH matches a non-halting behavior pattern after
    two complete simulations of its first four steps.

    But it doesn't match a correct non-halting behavior pattern, as halting programs also match that pattern, because DDD (when fixed to be a
    program) halts when run, as you have admitted.

    Of course, since your DDD isn't actualy a program as you have admitted,
    it can be neither Halting nor Non-Halting.

    All you are asserting the that you are allowed to LIE about things.

    Sorry, but that IS the truth of what you say.


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

    And idiots shoot at targets that are not there.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jun 8 22:38:07 2025
    XPost: comp.theory, sci.logic

    On 6/8/25 3:47 PM, olcott wrote:
    On 6/8/2025 12:17 PM, Fred. Zwarts wrote:
    Op 08.jun.2025 om 18:41 schreef olcott:
    On 6/8/2025 6:11 AM, Richard Damon wrote:
    On 6/7/25 7:54 PM, olcott wrote:
    On 6/7/2025 6:38 PM, Richard Damon wrote:
    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out >>>>>>>>>>>>>>>>>>> your mistake.

    See below, which shows that the simulations performed >>>>>>>>>>>>>>>>>> by HHH and HHH1 are identical up to the point that HHH >>>>>>>>>>>>>>>>>> aborts, as you have agreed on the record.



    False.  The correct trace is the one I posted, which >>>>>>>>>>>>>>>> shows all levels of emulation performed by HHH and HHH1. >>>>>>>>>>>>>>>> See the corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/ >>>>>>>>>>>>>> emulations? It is perfectly sensible to include nested >>>>>>>>>>>>>> emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side. >>>>>>>>>>>>> A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of >>>>>>>>>>>> these traces, the hierarchy can be "flattened" into one >>>>>>>>>>>> stream of nested simulations. You do this yourself every >>>>>>>>>>>> time you present one of your nested simulation traces.  Such >>>>>>>>>>>> a trace should include a simulation depth (or equivalent) >>>>>>>>>>>> for each entry.

    Two nested simulation traces can easily be presented side- >>>>>>>>>>>> by- side for comparisson.  You are just trying to divert >>>>>>>>>>>> attention from your own failings to properly understand the >>>>>>>>>>>> requirements.


    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH >>>>>>>>>>> [00002183] push ebp               [00002183] push ebp >>>>>>>>>>> [00002184] mov ebp,esp            [00002184] mov ebp,esp >>>>>>>>>>> [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD >>>>>>>>>>> [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH >>>>>>>>>>> *HHH1 emulates DDD once then HHH emulates DDD once, these match* >>>>>>>>>>>
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS* >>>>>>>>>>
    Because the correct emulation of the input doesn't call for >>>>>>>>>> this to be done, and the identity of the emulator doesn't
    affect the defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct >>>>>>>>>> emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the
    traces shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a
    partial simulation not reaching a final state doesn't establish
    non- halting.


    *CAN'T POSSIBLY REACH A FINAL STATE DOES ESTABLISH NOT HALTING*


    Right, but the subject of said proposition is the MACHINE, not a
    partial simulation of said machine.

    For simulations to be used to show non-halting, you must show that
    even after an unbounded number of steps simulated, it never reaches
    a final state.


    We have been over this too many times, either you are
    a liar or you have severe brain damage. DDD simulated
    by HHH matches a non-halting behavior pattern after
    two complete simulations of its first four steps.

    No, it does not. It decides too early. It needs three cycles to see
    the halting behaviour.

    All you have is a lack of sufficient technical competence.

    No, you do, as you have been undable to actually justify your disproven
    claims.

    Sorry, you are just proving how ignorant you are in the field, as you
    don't even understand the need to try to prove your lies.


    It needs to simulate more that the first four steps. It also needs to
    count the conditional branch instructions in HHH.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Jun 8 22:42:11 2025
    XPost: comp.theory, sci.logic

    On 6/8/25 3:48 PM, olcott wrote:
    On 6/8/2025 12:27 PM, Richard Damon wrote:
    On 6/8/25 12:41 PM, olcott wrote:
    On 6/8/2025 6:11 AM, Richard Damon wrote:
    On 6/7/25 7:54 PM, olcott wrote:
    On 6/7/2025 6:38 PM, Richard Damon wrote:
    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out >>>>>>>>>>>>>>>>>>> your mistake.

    See below, which shows that the simulations performed >>>>>>>>>>>>>>>>>> by HHH and HHH1 are identical up to the point that HHH >>>>>>>>>>>>>>>>>> aborts, as you have agreed on the record.



    False.  The correct trace is the one I posted, which >>>>>>>>>>>>>>>> shows all levels of emulation performed by HHH and HHH1. >>>>>>>>>>>>>>>> See the corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/ >>>>>>>>>>>>>> emulations? It is perfectly sensible to include nested >>>>>>>>>>>>>> emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side. >>>>>>>>>>>>> A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of >>>>>>>>>>>> these traces, the hierarchy can be "flattened" into one >>>>>>>>>>>> stream of nested simulations. You do this yourself every >>>>>>>>>>>> time you present one of your nested simulation traces.  Such >>>>>>>>>>>> a trace should include a simulation depth (or equivalent) >>>>>>>>>>>> for each entry.

    Two nested simulation traces can easily be presented side- >>>>>>>>>>>> by- side for comparisson.  You are just trying to divert >>>>>>>>>>>> attention from your own failings to properly understand the >>>>>>>>>>>> requirements.


    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH >>>>>>>>>>> [00002183] push ebp               [00002183] push ebp >>>>>>>>>>> [00002184] mov ebp,esp            [00002184] mov ebp,esp >>>>>>>>>>> [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD >>>>>>>>>>> [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH >>>>>>>>>>> *HHH1 emulates DDD once then HHH emulates DDD once, these match* >>>>>>>>>>>
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS* >>>>>>>>>>
    Because the correct emulation of the input doesn't call for >>>>>>>>>> this to be done, and the identity of the emulator doesn't
    affect the defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct >>>>>>>>>> emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the
    traces shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a
    partial simulation not reaching a final state doesn't establish
    non- halting.


    *CAN'T POSSIBLY REACH A FINAL STATE DOES ESTABLISH NOT HALTING*


    Right, but the subject of said proposition is the MACHINE, not a
    partial simulation of said machine.

    For simulations to be used to show non-halting, you must show that
    even after an unbounded number of steps simulated, it never reaches
    a final state.


    We have been over this too many times, either you are
    a liar or you have severe brain damage. DDD simulated
    by HHH matches a non-halting behavior pattern after
    two complete simulations of its first four steps.

    But it doesn't match a correct non-halting behavior pattern,

    All you have is a lack of sufficient technical competence.


    Nope, you are just proving that YOU don't understand enough of what you
    are taling about to understand what you need to prove,

    I have pointed out your errors, and you only reply is a baseless "but
    you are wrong and I am right".

    I have pointed out the DEFINITIONS of things, that can be verified from
    any reputable source on the subject.

    YOU have made claims that you can not show a reputatable source to back
    them.

    WHO IS SHOWING TECHNICAL COMPTENCE?

    The one using the real definitions, or the one just making up stuff and
    can't find something to justify it?

    Sorry, you are just proving your incompetence.

    Your reputation has been sunk to the bottom of the lake of fire by your
    own words that admit to the facts that show that you argument is just a category error, and that you are just too stupid to understand that problem.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Mon Jun 9 12:33:00 2025
    XPost: comp.theory, sci.logic

    Op 08.jun.2025 om 21:47 schreef olcott:
    On 6/8/2025 12:17 PM, Fred. Zwarts wrote:
    Op 08.jun.2025 om 18:41 schreef olcott:
    On 6/8/2025 6:11 AM, Richard Damon wrote:
    On 6/7/25 7:54 PM, olcott wrote:
    On 6/7/2025 6:38 PM, Richard Damon wrote:
    On 6/7/25 10:13 AM, olcott wrote:
    On 6/7/2025 6:18 AM, Richard Damon wrote:
    On 6/6/25 11:43 PM, olcott wrote:
    On 6/6/2025 9:02 PM, Richard Damon wrote:
    On 6/6/25 12:53 PM, olcott wrote:
    On 6/6/2025 11:06 AM, Mike Terry wrote:
    On 05/06/2025 05:27, olcott wrote:
    On 6/4/2025 10:55 PM, Mike Terry wrote:
    On 05/06/2025 02:39, olcott wrote:
    On 6/4/2025 8:28 PM, dbush wrote:
    On 6/4/2025 9:08 PM, olcott wrote:
    On 6/4/2025 7:41 PM, dbush wrote:
    On 6/4/2025 8:32 PM, olcott wrote:

    Show me this side-by-side trace and I will point out >>>>>>>>>>>>>>>>>>> your mistake.

    See below, which shows that the simulations performed >>>>>>>>>>>>>>>>>> by HHH and HHH1 are identical up to the point that HHH >>>>>>>>>>>>>>>>>> aborts, as you have agreed on the record.



    False.  The correct trace is the one I posted, which >>>>>>>>>>>>>>>> shows all levels of emulation performed by HHH and HHH1. >>>>>>>>>>>>>>>> See the corrections I made to your comments

    It is not supposed to do that.

    Are you saying it's not supposed to include /nested/ >>>>>>>>>>>>>> emulations? It is perfectly sensible to include nested >>>>>>>>>>>>>> emulations.


    It can include nested simulations yet nested
    simulations are in a hierarchy thus not side-by-side. >>>>>>>>>>>>> A side-by-side analysis must be side-by-side.


    Hierarchies can be compared side-by-side.  In the case of >>>>>>>>>>>> these traces, the hierarchy can be "flattened" into one >>>>>>>>>>>> stream of nested simulations. You do this yourself every >>>>>>>>>>>> time you present one of your nested simulation traces.  Such >>>>>>>>>>>> a trace should include a simulation depth (or equivalent) >>>>>>>>>>>> for each entry.

    Two nested simulation traces can easily be presented side- >>>>>>>>>>>> by- side for comparisson.  You are just trying to divert >>>>>>>>>>>> attention from your own failings to properly understand the >>>>>>>>>>>> requirements.


    *From the execution trace of HHH1(DDD) shown below*
    DDD emulated by HHH1              DDD emulated by HHH >>>>>>>>>>> [00002183] push ebp               [00002183] push ebp >>>>>>>>>>> [00002184] mov ebp,esp            [00002184] mov ebp,esp >>>>>>>>>>> [00002186] push 00002183 ; DDD    [00002186] push 00002183 ; DDD >>>>>>>>>>> [0000218b] call 000015c3 ; HHH    [0000218b] call 000015c3 ; HHH >>>>>>>>>>> *HHH1 emulates DDD once then HHH emulates DDD once, these match* >>>>>>>>>>>
    *Then HHH emulates itself emulating DDD, HHH1 NEVER DOES THIS* >>>>>>>>>>
    Because the correct emulation of the input doesn't call for >>>>>>>>>> this to be done, and the identity of the emulator doesn't
    affect the defintion of a correct emulation.

    That fact that NONE of your traces actually show a correct >>>>>>>>>> emulation,

    I have corrected you on this hundreds of times and
    you keep "forgetting" what I said.



    That you have an "excuse" doesn't change the fact that the
    traces shown are not correct.


    *No actual error has ever been pointed out*
    One of the incoherent notions of error that you
    have proposed is that a non-terminating input
    was not simulated to completion.

    No, it just that you don't seem to understand the concept that a
    partial simulation not reaching a final state doesn't establish
    non- halting.


    *CAN'T POSSIBLY REACH A FINAL STATE DOES ESTABLISH NOT HALTING*


    Right, but the subject of said proposition is the MACHINE, not a
    partial simulation of said machine.

    For simulations to be used to show non-halting, you must show that
    even after an unbounded number of steps simulated, it never reaches
    a final state.


    We have been over this too many times, either you are
    a liar or you have severe brain damage. DDD simulated
    by HHH matches a non-halting behavior pattern after
    two complete simulations of its first four steps.

    No, it does not. It decides too early. It needs three cycles to see
    the halting behaviour.

    All you have is a lack of sufficient technical competence.

    Ad hominem attack, proving that there are no counter argument.

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