• Re: Efficient way to communicate with olcott --- DON'T LIE OR TRY TO MI

    From Richard Heathfield@21:1/5 to olcott on Tue Aug 19 01:45:47 2025
    On 19/08/2025 01:36, olcott wrote:
    On 8/18/2025 7:25 PM, Richard Heathfield wrote:
    On 19/08/2025 01:15, olcott wrote:

    <snip>


    On 8/18/2025 6:05 PM, Richard Heathfield wrote:
    It is an easily verified fact, as you love to say,
    that if DD calls HHH (as it does) and HHH calls DD
    (as, through simulation, it effectively does) that
    HHH(DD) can never halt naturally, so it will have
    to abort the recursion and report its result as 0
    - didn't halt.



    Disingenuous. My point, which you have left far behind when
    hiking the above from its setting, is that you can use the
    above fact to improve HHH() into doing a far better job --- so
    much better, in fact, that to claim that what you currently
    have as "correctly simulating" is very clearly not the case.


    *What you finally admitted to has been my whole point all along*

    The HHH(DD) = 0 thing? Is that why you're so cross with me? I
    agreed to that a *long* long time ago. You can call it an
    "admission" if you like - why should I care? - but you still
    don't have a "correct simulation" of DD. What you have is a
    reasonably truncated simulation of infinite recursion. At no
    point do you simulate what happens /afterwards/.

    You have always maintained that /afterwards/ is impossible to
    simulate. I have now shown you that it can be done after all.

    You should be pleased. That you are not is highly suspicious.


    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Heathfield@21:1/5 to olcott on Tue Aug 19 02:22:04 2025
    On 19/08/2025 02:02, olcott wrote:
    On 8/18/2025 7:45 PM, Richard Heathfield wrote:
    On 19/08/2025 01:36, olcott wrote:
    On 8/18/2025 7:25 PM, Richard Heathfield wrote:
    On 19/08/2025 01:15, olcott wrote:

    <snip>


    On 8/18/2025 6:05 PM, Richard Heathfield wrote:
    It is an easily verified fact, as you love to say,
    that if DD calls HHH (as it does) and HHH calls DD
    (as, through simulation, it effectively does) that
    HHH(DD) can never halt naturally, so it will have
    to abort the recursion and report its result as 0
    - didn't halt.
    ;


    Disingenuous. My point, which you have left far behind when
    hiking the above from its setting, is that you can use the
    above fact to improve HHH() into doing a far better job ---
    so much better, in fact, that to claim that what you
    currently have as "correctly simulating" is very clearly not
    the case.


    *What you finally admitted to has been my whole point all along*

    The HHH(DD) = 0 thing? Is that why you're so cross with me? I
    agreed to that a *long* long time ago. You can call it an
    "admission" if you like - why should I care? - but you still
    don't have a "correct simulation" of DD.

    Because we all know that all non-terminating simulations
    must be simulated until they terminate or they are not correct.

    Well, there's certainly a case to be made for that point of view.

    What you have is a reasonably truncated simulation of infinite
    recursion. At no point do you simulate what happens /afterwards/.


    *Yes I do not simulate anything that never happens*

    How do you know it never happens if you don't simulate it?

    When HHH aborts its simulation then every aspect
    of every recursive simulation becomes 100% totally
    dead.

    All that dies is the call to HHH. There's no need to kill off the
    rest of the code.

    There is no stack unwinding of any stack of
    any dead process.

    Then you didn't abort the simulation, so your simulation is still
    running, so you can't report, so you're not a decider. You lose.

    You have always maintained that /afterwards/ is impossible to
    simulate. I have now shown you that it can be done after all.

    *By failing to understand the notion of a dead process*

    You said yourself that DD is not an executing process. Have you
    changed your mind?

    Heh we did finally make progress on my one key point.

    Yes, we agreed that HHH(DD) can reasonably return 0. What you
    have failed to establish is what happens next.

    We're getting closer. You should be pleased. That you are not is
    highly suspicious.

    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Heathfield@21:1/5 to olcott on Tue Aug 19 02:53:52 2025
    On 19/08/2025 02:32, olcott wrote:

    <snip>

    That you think that a dead process has behavior
    seems nuts.

    That you think it's dead seems nuts. For one thing, you're
    /simulating/ it --- or rather, single-stepping it. You can do
    what you like with it - two steps forward three back if you feel
    so inclined - you're just moving it around the states. It's only
    dead if you want it to be... and for your own purposes you want
    it dead... but you don't have to kill HHH's caller just because
    you snuffed out HHH.

    Now, you know that HHH(DD) returns 0.

    When DD calls HHH(DD), it requires a return value.

    HHH must report.

    It reports to DD.

    We know that it reports 0.

    Therefore your simulation, having memoised HHH(DD), knows to
    assign 0 to Halt_Status.

    Let the simulation continue from there.

    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Heathfield@21:1/5 to olcott on Tue Aug 19 03:17:37 2025
    On 19/08/2025 03:02, olcott wrote:
    On 8/18/2025 8:53 PM, Richard Heathfield wrote:
    On 19/08/2025 02:32, olcott wrote:

    <snip>

    That you think that a dead process has behavior
    seems nuts.

    That you think it's dead seems nuts.

    The process of HHH simulating DD is 100% totally
    dead it is as if DD has been erased from memory.

    Which invocation? How deep?

    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Heathfield@21:1/5 to olcott on Tue Aug 19 03:42:39 2025
    On 19/08/2025 03:37, olcott wrote:
    On 8/18/2025 9:17 PM, Richard Heathfield wrote:
    On 19/08/2025 03:02, olcott wrote:
    On 8/18/2025 8:53 PM, Richard Heathfield wrote:
    On 19/08/2025 02:32, olcott wrote:

    <snip>

    That you think that a dead process has behavior
    seems nuts.

    That you think it's dead seems nuts.

    The process of HHH simulating DD is 100% totally
    dead it is as if DD has been erased from memory.

    Which invocation? How deep?


    The only thing driving any recursive simulations
    is the simulation of the outermost DD. When that
    stops every simulation everywhere totally stops.

    Then that's your bug.

    No simulated stack has any chance of ever unwinding.

    No wonder your simulation fails!

    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Tue Aug 19 07:56:14 2025
    Am Mon, 18 Aug 2025 20:02:26 -0500 schrieb olcott:
    On 8/18/2025 7:45 PM, Richard Heathfield wrote:
    On 19/08/2025 01:36, olcott wrote:
    On 8/18/2025 7:25 PM, Richard Heathfield wrote:

    Disingenuous. My point, which you have left far behind when hiking
    the above from its setting, is that you can use the above fact to
    improve HHH() into doing a far better job --- so much better, in
    fact, that to claim that what you currently have as "correctly
    simulating" is very clearly not the case.

    *What you finally admitted to has been my whole point all along*

    The HHH(DD) = 0 thing? Is that why you're so cross with me? I agreed to
    that a *long* long time ago. You can call it an "admission" if you like
    - why should I care? - but you still don't have a "correct simulation"
    of DD.
    Because we all know that all non-terminating simulations must be
    simulated until they terminate or they are not correct.

    Yes! It’s not enough that no instructions are simulated *incorrectly*.

    What you have is a reasonably truncated simulation of infinite
    recursion. At no point do you simulate what happens /afterwards/.
    *Yes I do not simulate anything that never happens*
    When HHH aborts its simulation then every aspect of every recursive simulation becomes 100% totally dead. There is no stack unwinding of any stack of any dead process.
    That doesn’t mean that that program would stop and not do something afterwards if executed or simulated further.

    You have always maintained that /afterwards/ is impossible to simulate.
    I have now shown you that it can be done after all.
    *By failing to understand the notion of a dead process*
    …, what happens?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Heathfield@21:1/5 to olcott on Tue Aug 19 15:34:23 2025
    On 19/08/2025 15:26, olcott wrote:
    Once HHH(DD) has aborted its simulation none of
    the recursive simulations has any behavior.

    And that's your bug.

    DD is a C function. It would be easy to put a direct call to it
    into main and compile it into a program. Its behaviour then
    departs from your simulation. Ergo, your simulation is incorrect.

    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Wed Aug 20 10:54:13 2025
    Op 19.aug.2025 om 23:55 schreef olcott:
    On 8/19/2025 3:52 PM, Chris M. Thomasson wrote:
    On 8/19/2025 7:34 AM, Richard Heathfield wrote:
    On 19/08/2025 15:26, olcott wrote:
    Once HHH(DD) has aborted its simulation none of
    the recursive simulations has any behavior.

    And that's your bug.

    DD is a C function. It would be easy to put a direct call to it into
    main and compile it into a program. Its behaviour then departs from
    your simulation. Ergo, your simulation is incorrect.


    Perhaps his simulator should just take C source code as input, compile
    it and run/simulate it in a sandbox via an entry point, say main? In
    this scenario, his system would require a compiler.

    I was thinking of something like that.
    All of the LLM systems can figure out on their
    own that HHH(DD) would correctly return 0 for non-halting.
    A static analysis of the source-code is what they are doing.



    All LLM systems make this error, because you fed them incorrect input.
    They are not smart enough to analyse the input and see the
    contradictions and errors in it.
    You feed them with your incorrect assumption that HHH is correct to see non-termination behaviour and ten use it to prove that HHH is correct to
    see non-termination behaviour.
    That is an invalid circular reasoning, that cannot be use as a proof.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Heathfield@21:1/5 to Fred. Zwarts on Wed Aug 20 10:42:52 2025
    On 20/08/2025 09:54, Fred. Zwarts wrote:
    Op 19.aug.2025 om 23:55 schreef olcott:
    On 8/19/2025 3:52 PM, Chris M. Thomasson wrote:
    On 8/19/2025 7:34 AM, Richard Heathfield wrote:
    On 19/08/2025 15:26, olcott wrote:
    Once HHH(DD) has aborted its simulation none of
    the recursive simulations has any behavior.

    And that's your bug.

    DD is a C function. It would be easy to put a direct call to
    it into main and compile it into a program. Its behaviour
    then departs from your simulation. Ergo, your simulation is
    incorrect.


    Perhaps his simulator should just take C source code as input,
    compile it and run/simulate it in a sandbox via an entry
    point, say main? In this scenario, his system would require a
    compiler.

    I was thinking of something like that.
    All of the LLM systems can figure out on their
    own that HHH(DD) would correctly return 0 for non-halting.
    A static analysis of the source-code is what they are doing.



    All LLM systems make this error, because you fed them incorrect
    input. They are not smart enough to analyse the input and see the contradictions and errors in it.

    Actually, they may be. They're just reluctant to call Olcott out.

    A while back I gave ChatGPT the same input without the lies, and
    it correctly deduced that HHH cannot return a "correct" value.

    --
    Richard Heathfield
    Email: rjh at cpax dot org dot uk
    "Usenet is a strange place" - dmr 29 July 1999
    Sig line 4 vacant - apply within

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Aug 20 07:27:57 2025
    On 8/19/25 10:26 AM, olcott wrote:
    On 8/19/2025 2:56 AM, joes wrote:
    Am Mon, 18 Aug 2025 20:02:26 -0500 schrieb olcott:
    On 8/18/2025 7:45 PM, Richard Heathfield wrote:
    On 19/08/2025 01:36, olcott wrote:
    On 8/18/2025 7:25 PM, Richard Heathfield wrote:

    Disingenuous. My point, which you have left far behind when hiking >>>>>> the above from its setting, is that you can use the above fact to
    improve HHH() into doing a far better job --- so much better, in
    fact, that to claim that what you currently have as "correctly
    simulating" is very clearly not the case.

    *What you finally admitted to has been my whole point all along*

    The HHH(DD) = 0 thing? Is that why you're so cross with me? I agreed to >>>> that a *long* long time ago. You can call it an "admission" if you like >>>> - why should I care? - but you still don't have a "correct simulation" >>>> of DD.
    Because we all know that all non-terminating simulations must be
    simulated until they terminate or they are not correct.

    Yes! It’s not enough that no instructions are simulated *incorrectly*.

    What you have is a reasonably truncated simulation of infinite
    recursion. At no point do you simulate what happens /afterwards/.
    *Yes I do not simulate anything that never happens*
    When HHH aborts its simulation then every aspect of every recursive
    simulation becomes 100% totally dead. There is no stack unwinding of any >>> stack of any dead process.

    That doesn’t mean that that program would stop and not do something
    afterwards if executed or simulated further.

    You have always maintained that /afterwards/ is impossible to simulate. >>>> I have now shown you that it can be done after all.
    *By failing to understand the notion of a dead process*
    …, what happens?


    Once HHH(DD) has aborted its simulation none of
    the recursive simulations has any behavior.
    Mike explains this well.
    W


    Sure it does, as behavior is what it will do if not aborted.

    That is your own definition, but of course you are just self-inconsistent.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Aug 20 07:30:18 2025
    On 8/19/25 5:55 PM, olcott wrote:
    On 8/19/2025 3:52 PM, Chris M. Thomasson wrote:
    On 8/19/2025 7:34 AM, Richard Heathfield wrote:
    On 19/08/2025 15:26, olcott wrote:
    Once HHH(DD) has aborted its simulation none of
    the recursive simulations has any behavior.

    And that's your bug.

    DD is a C function. It would be easy to put a direct call to it into
    main and compile it into a program. Its behaviour then departs from
    your simulation. Ergo, your simulation is incorrect.


    Perhaps his simulator should just take C source code as input, compile
    it and run/simulate it in a sandbox via an entry point, say main? In
    this scenario, his system would require a compiler.

    I was thinking of something like that.
    All of the LLM systems can figure out on their
    own that HHH(DD) would correctly return 0 for non-halting.
    A static analysis of the source-code is what they are doing.


    Based on a wrong definition of what HHH doese.

    Since it doesn't do what it is claimed to do, the answer is wrong.

    The problem is you use the fact that it reaches a proported "non-halting pattern" as proof that the program is non-halting, but halting programs
    can have that same pattern, so the pattern is just not what you claim it
    to be.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to Chris M. Thomasson on Wed Aug 20 07:46:50 2025
    On 8/19/25 4:49 PM, Chris M. Thomasson wrote:
    On 8/18/2025 6:22 PM, Richard Heathfield wrote:
    [...]
    Then you didn't abort the simulation, so your simulation is still
    running, so you can't report, so you're not a decider. You lose.

    Is his "simulation" akin to artificially killing a running process and
    then deem said process 100% non-halting? We don't know for sure if it
    would have halted some time down the road... Am I getting closer to understanding his system? Flip a coin gives better output...?

    The fundamental issue with his system is that his "programs" are not
    programms.

    The decider is some amorphous thing that can change, and thus not a
    program. And his input refers to something (the program deciding it)
    that isn't part of its code or its input, and thus isn't a program, but
    just a template for building programs.

    This would seem to make a system where could try to define "non-halting"
    of such template as a template that no amorphous set of deciders could
    ever simulate it to a final state.

    The problem is he can't even get a definition of this to work, as in set
    of things that change aren't even "programs" in the computability sense,
    as they look at and alter things that aren't part of the input to
    implement his ideas. But this means that there does exist a version of
    HHH that can simulate its input to the final state, by using a flag to
    let the simulated copy of HHH to know that it is being simulated by HHH
    (which he actually has in his code, but better disguised) which causes
    the simulated decider to just return 0 quickly.

    This allows the outer HHH to simulate its input to the end.

    If he was willing to admit what the problem he was actually working on,
    perhaps he could get help to figure out a better system statement, but
    then he would be admitting that he isn't working on the problem that he
    "needs" to be working on.

    His bigger problem is that he doesn't really care about the halting
    problem, but bigger related problems in more general logic. But these
    can be proven from the concepts of the Halting Problem and its proof.
    So, he wants to prove that proof wrong, without needing to actually
    understand it.

    His actual problem is that he doesn't understand how things can be true
    but unprovable, and thus there is no computable predicate that can tell iniversally if a statment is true or false.

    He just ignores that it IS possible to determine this for most cases, it
    is just the universally point that causes the issue.

    His other problem is he doesn't understand the difference between worlds
    of "Formal Logic" where proof is a formally defined system, and
    discussions about "Reality" which we just determine "facts" about it by
    our senses.

    "Knowledge" in these two systems are different. Formal system start from Definitions and Axioms, things established by fiat and certainty. In
    Reality, we don't start with any actual knowledge of the actual details
    of how things work, but we observe and try to deduce. "Knowledge" isn't certainty, but our best estimate of what actually is.

    These are just incompatible in processing.

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