• Re: ChatGPT refutes the key rebuttal of my work

    From Richard Damon@21:1/5 to olcott on Sun Oct 13 09:19:48 2024
    On 10/13/24 8:53 AM, olcott wrote:
    Although it is possible for LLM systems to lie: https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence)

    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    *The key premises are simply*
    (a) the source code for DDD

    WHich isn't the source code for the PROGRAM DDD

    Try to run that program just by itself.

    It won't work, you need to include HHH (and everything it calls) so that
    the "source code" for DDD needs to include the definition of all of that.

    Sorry, you are just proving you don't understand what you are talking
    about.


    void DDD()
    {
      HHH(DDD);
      return;
    }

    (b) The design of HHH as a simulating termination analyzer.

    Which gets the wrong answer.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    Click on the above link to directly talk to ChatGPT about HHH
    and DDD without logging in.

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.


    You have taught Chat GPT this error as shown in this statement:


    The fact that DDD() halts in real execution is because HHH intervenes to prevent infinite recursion, not because DDD() halts on its own.


    But DDD() DOES halt on its own, becuase the HHH that it calls will
    return to it. All you have done is show you are a good enough liar to
    teach the AI to lie.

    Sorry, but that is just the facts, the one thing you have shown yourself
    good at is stating lies.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Oct 13 14:49:39 2024
    On 10/13/24 9:28 AM, olcott wrote:
    On 10/13/2024 8:19 AM, Richard Damon wrote:
    On 10/13/24 8:53 AM, olcott wrote:
    Although it is possible for LLM systems to lie:
    https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence)

    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    *The key premises are simply*
    (a) the source code for DDD

    WHich isn't the source code for the PROGRAM DDD

    Try to run that program just by itself.

    It won't work, you need to include HHH (and everything it calls) so
    that the "source code" for DDD needs to include the definition of all
    of that.

    Sorry, you are just proving you don't understand what you are talking
    about.


    void DDD()
    {
       HHH(DDD);
       return;
    }

    (b) The design of HHH as a simulating termination analyzer.

    Which gets the wrong answer.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    Click on the above link to directly talk to ChatGPT about HHH
    and DDD without logging in.

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.


    You have taught Chat GPT this error as shown in this statement:


    I have only provided the source-code for DDD and the design of HHH.
    You have not shown how any details of exactly what I told ChatGPT
    are incorrect.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Oct 13 19:49:17 2024
    On 10/13/24 3:29 PM, olcott wrote:
    On 10/13/2024 1:49 PM, Richard Damon wrote:
    On 10/13/24 9:28 AM, olcott wrote:
    On 10/13/2024 8:19 AM, Richard Damon wrote:
    On 10/13/24 8:53 AM, olcott wrote:
    Although it is possible for LLM systems to lie:
    https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence) >>>>>
    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    *The key premises are simply*
    (a) the source code for DDD

    WHich isn't the source code for the PROGRAM DDD

    Try to run that program just by itself.

    It won't work, you need to include HHH (and everything it calls) so
    that the "source code" for DDD needs to include the definition of
    all of that.

    Sorry, you are just proving you don't understand what you are
    talking about.


    void DDD()
    {
       HHH(DDD);
       return;
    }

    (b) The design of HHH as a simulating termination analyzer.

    Which gets the wrong answer.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    Click on the above link to directly talk to ChatGPT about HHH
    and DDD without logging in.

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.


    You have taught Chat GPT this error as shown in this statement:


    I have only provided the source-code for DDD and the design of HHH.
    You have not shown how any details of exactly what I told ChatGPT
    are incorrect.



    You mean like this statement:

    The termination analyzer HHH is designed to detect non-terminating
    behavior. When HHH simulates DDD and sees this pattern of infinite
    recursive calls, it identifies that DDD will not terminate on its own.


    I didn't say that. ChatGPT said that.
    ChatGPT used the first page starting with "You said:"
    as its entire basis.

    *Everything that I said is indented two inches*
    Everything that ChatGPT said is prefaced by its logo symbol.

    So when you said:

    Every C programmer that knows that when HHH emulates the machine
    language of, Infinite_Recursion it must abort this emulation so that
    itself can terminate normally.

    When this is construed as non-halting criteria then simulating
    termination analyzer HHH is correct to reject this input as non-halting
    by returning 0 to its caller.

    We get the same repetitive pattern when DDD is correctly emulated by
    HHH. HHH emulates DDD that calls HHH(DDD) to do this again.


    You LIED, as that is NOT the non-halting critera, and we do not get the
    "same pattern"

    I guess you don't understand the meaning of the words.


    Arguements based on false premises are invalid.


    Everything else that I said besides the first page
    was merely a challenge to ChatGPT's understanding.


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sun Oct 13 20:07:44 2024
    On 10/13/24 8:01 PM, olcott wrote:
    On 10/13/2024 6:49 PM, Richard Damon wrote:
    On 10/13/24 3:29 PM, olcott wrote:
    On 10/13/2024 1:49 PM, Richard Damon wrote:
    On 10/13/24 9:28 AM, olcott wrote:
    On 10/13/2024 8:19 AM, Richard Damon wrote:
    On 10/13/24 8:53 AM, olcott wrote:
    Although it is possible for LLM systems to lie:
    https://en.wikipedia.org/wiki/
    Hallucination_(artificial_intelligence)

    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    *The key premises are simply*
    (a) the source code for DDD

    WHich isn't the source code for the PROGRAM DDD

    Try to run that program just by itself.

    It won't work, you need to include HHH (and everything it calls)
    so that the "source code" for DDD needs to include the definition
    of all of that.

    Sorry, you are just proving you don't understand what you are
    talking about.


    void DDD()
    {
       HHH(DDD);
       return;
    }

    (b) The design of HHH as a simulating termination analyzer.

    Which gets the wrong answer.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    Click on the above link to directly talk to ChatGPT about HHH
    and DDD without logging in.

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.


    You have taught Chat GPT this error as shown in this statement:


    I have only provided the source-code for DDD and the design of HHH.
    You have not shown how any details of exactly what I told ChatGPT
    are incorrect.



    You mean like this statement:

    The termination analyzer HHH is designed to detect non-terminating
    behavior. When HHH simulates DDD and sees this pattern of infinite
    recursive calls, it identifies that DDD will not terminate on its own. >>>>

    I didn't say that. ChatGPT said that.
    ChatGPT used the first page starting with "You said:"
    as its entire basis.

    *Everything that I said is indented two inches*
    Everything that ChatGPT said is prefaced by its logo symbol.

    So when you said:

    Every C programmer that knows that when HHH emulates the machine
    language of, Infinite_Recursion it must abort this emulation so that
    itself can terminate normally.

    When this is construed as non-halting criteria then simulating
    termination analyzer HHH is correct to reject this input as non-
    halting by returning 0 to its caller.

    We get the same repetitive pattern when DDD is correctly emulated by
    HHH. HHH emulates DDD that calls HHH(DDD) to do this again.


    You LIED, as that is NOT the non-halting critera, and we do not get
    the "same pattern"

    I guess you don't understand the meaning of the words.


    Arguements based on false premises are invalid.


    I just asked it this:
    Does HHH have correct non-halting criteria?

    It explained all of the details of how you are wrong.
    Try it yourself.

    No, you said that WAS the correct non-halting criteria.

    You said "When this is construed as non-halting criteria"

    That is a statement of fact, affirming that statement.

    It also is a LIE.

    All you are showing is you can convince an AI to beleive yoru LIES.

    This is why AI can not be a real "truth detector".

    Sorry, you are just showing you don't know what you are doing.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Mon Oct 14 12:04:28 2024
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie: https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence)

    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    No reasoning shown.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Oct 14 12:06:02 2024
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:

    ChatGPT does correctly apply truth preserving operations to the
    premises that it was provided regarding the behavior of DDD and HHH.
    *Try to find a mistake in its reasoning*

    No reasoning shown.

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong when
    it reports that DDD does not terminate because DDD does terminate it
    will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.

    --
    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 Damon@21:1/5 to olcott on Mon Oct 14 07:21:41 2024
    On 10/14/24 5:49 AM, olcott wrote:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:
    https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence)

    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    No reasoning shown.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.



    No, it admits that DDD does halt, but that HHH must be correct to say it doesn't, ... because of the lies you told it.

    Its reasoning is based on the incorrect presumption that the HHH that
    DDD calls is not part of the program DDD, because you have broken the definition of a program.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Oct 14 15:46:09 2024
    Am Mon, 14 Oct 2024 10:38:00 -0500 schrieb olcott:
    On 10/14/2024 6:21 AM, Richard Damon wrote:
    On 10/14/24 5:49 AM, olcott wrote:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:
    ChatGPT does correctly apply truth preserving operations to the
    premises that it was provided regarding the behavior of DDD and HHH. >>>>> *Try to find a mistake in its reasoning*
    No reasoning shown.
    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong
    when it reports that DDD does not terminate because DDD does terminate
    it will explain your mistake to you.
    No, it admits that DDD does halt, but that HHH must be correct to say
    it doesn't, ... because of the lies you told it.
    It proves that it has a much deeper understanding than anything that I
    told it.

    Its reasoning is based on the incorrect presumption that the HHH that
    DDD calls is not part of the program DDD,
    (1) DDD never has been a program it is a C function.
    (2) HHH does correctly emulated itself emulating DDD
    this <is> a contiguous sequence of computation.
    A program is a C function called from main(). This corresponds to the
    behaviour of the actual execution.

    because you have broken the definition of a program.
    I am not the one saying that a C function <is> a program.
    You should not be so sloppy in your use of terminology.
    DDD emulated by HHH including HHH emulating itself emulating DDD is a contiguous sequence of computation.
    It is not and never has been a program. I think of DDD and HHH as
    virtual machines.
    --
    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 Damon@21:1/5 to olcott on Mon Oct 14 19:50:25 2024
    On 10/14/24 12:07 PM, olcott wrote:
    On 10/14/2024 10:46 AM, joes wrote:
    Am Mon, 14 Oct 2024 10:38:00 -0500 schrieb olcott:
    On 10/14/2024 6:21 AM, Richard Damon wrote:
    On 10/14/24 5:49 AM, olcott wrote:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:
    ChatGPT does correctly apply truth preserving operations to the
    premises that it was provided regarding the behavior of DDD and HHH. >>>>>>> *Try to find a mistake in its reasoning*
    No reasoning shown.
    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong
    when it reports that DDD does not terminate because DDD does terminate >>>>> it will explain your mistake to you.
    No, it admits that DDD does halt, but that HHH must be correct to say
    it doesn't, ... because of the lies you told it.
    It proves that it has a much deeper understanding than anything that I
    told it.

    Its reasoning is based on the incorrect presumption that the HHH that
    DDD calls is not part of the program DDD,
    (1) DDD never has been a program it is a C function.
    (2) HHH does correctly emulated itself emulating DDD
          this <is> a contiguous sequence of computation.
    A program is a C function called from main(). This corresponds to the
    behaviour of the actual execution.


    I said that DDD never has never been a program and
    you change the subject as your strawman deception rebuttal.

    And thus you admit that you have been lying about working on the Halting problem.

    Your ship is sunk, and gone forever, you just admitted that you are
    nothing but a stupid liar that never knew what he was talking about,
    even when people did there best to teach you.


    because you have broken the definition of a program.
    I am not the one saying that a C function <is> a program.
    You should not be so sloppy in your use of terminology.
    DDD emulated by HHH including HHH emulating itself emulating DDD is a
    contiguous sequence of computation.
    It is not and never has been a program. I think of DDD and HHH as
    virtual machines.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Tue Oct 15 11:33:33 2024
    On 2024-10-14 15:18:43 +0000, olcott said:

    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:

    ChatGPT does correctly apply truth preserving operations to the
    premises that it was provided regarding the behavior of DDD and HHH. >>>>> *Try to find a mistake in its reasoning*

    No reasoning shown.

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong when >>> it reports that DDD does not terminate because DDD does terminate it
    will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.

    The explanation is quite good. I will take what you said
    to mean that it was over your head or didn't bother to
    look at it.

    You never confirmed that you even know what infinite
    recursion is.

    Could you confirm that you know whether there is an infinite recursion
    in DDD?

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Tue Oct 15 11:27:35 2024
    On 2024-10-14 09:49:22 +0000, olcott said:

    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:
    https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence)

    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    No reasoning shown.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.

    Possibly, but you have not shown any reasoning. The only relevant
    things on the page behind the link is:

    "This conversation may reflect the link creator’s personalized
    data, which isn’t shared and can meaningfully change how the
    model responds."

    If the link "Continue conversation" is clinked it shows a page
    with the note

    "ChatGPT can make mistakes. Check important info."

    Enough for me.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Tue Oct 15 09:50:25 2024
    Am Mon, 14 Oct 2024 11:07:28 -0500 schrieb olcott:
    On 10/14/2024 10:46 AM, joes wrote:
    Am Mon, 14 Oct 2024 10:38:00 -0500 schrieb olcott:
    On 10/14/2024 6:21 AM, Richard Damon wrote:
    On 10/14/24 5:49 AM, olcott wrote:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Its reasoning is based on the incorrect presumption that the HHH that
    DDD calls is not part of the program DDD,
    (1) DDD never has been a program it is a C function.
    (2) HHH does correctly emulated itself emulating DDD
    this <is> a contiguous sequence of computation.
    A program is a C function called from main(). This corresponds to the
    behaviour of the actual execution.
    I said that DDD never has never been a program and you change the
    subject as your strawman deception rebuttal.
    What the fuck is wrong with you? I referred directly to your statement, disagreeing with it. DDD is a program the same way that HHH is. What
    use is the distinction between a program and a C function? Fine, HHH
    is a part of the "C function" DDD.

    --
    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 Damon@21:1/5 to olcott on Tue Oct 15 07:35:06 2024
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:

    ChatGPT does correctly apply truth preserving operations to the
    premises that it was provided regarding the behavior of DDD and HHH. >>>>>>> *Try to find a mistake in its reasoning*

    No reasoning shown.

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong
    when
    it reports that DDD does not terminate because DDD does terminate it >>>>> will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.

    The explanation is quite good. I will take what you said
    to mean that it was over your head or didn't bother to
    look at it.

    You never confirmed that you even know what infinite
    recursion is.


    No, he means your argument is just non-sense, and it is just a
    blantant lie that you put forwards because you just don't understand
    what you are talking about.,

    In other words you coward away from trying to convince
    ChatGPT that is is incorrect.

    What do you mean. With one statement I got it to admit that the ACTUAL
    behavior of DDD was to halt.


    Since you say that it is a YES man it should be easy
    for you to get it to admit that it is wrong.


    Which I did,

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.


    I did that, and it admitted that DDD halts, it just tries to justify why
    a wrong answer must be right.

    I don't need to convince it otherwise, as the objective was reached.


    Why don't you go and try to explain to all the electiond deniers and
    climate change deniers that they are wrong. Because people, just like
    AIs, can be suborn, and that is exactly what YOU are.

    Sorry, you are just proving how stupid your position is, that you base
    your worth on what an AI that you have feed your lies to says. Sorry,
    you have sealed your doom.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Tue Oct 15 15:17:01 2024
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    ChatGPT does correctly apply truth preserving operations to the >>>>>>>>> premises that it was provided regarding the behavior of DDD and >>>>>>>>> HHH.
    *Try to find a mistake in its reasoning*
    No reasoning shown.
    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be
    wrong when it reports that DDD does not terminate because DDD does >>>>>>> terminate it will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.
    The explanation is quite good. I will take what you said to mean
    that it was over your head or didn't bother to look at it.
    You never confirmed that you even know what infinite recursion is.
    No, he means your argument is just non-sense, and it is just a
    blantant lie that you put forwards because you just don't understand
    what you are talking about.,
    In other words you coward away from trying to convince ChatGPT that is
    is incorrect.
    What do you mean. With one statement I got it to admit that the ACTUAL
    behavior of DDD was to halt.


    Since you say that it is a YES man it should be easy for you to get it
    to admit that it is wrong.
    Which I did,

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong
    when it reports that DDD does not terminate because DDD does terminate
    it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to justify
    why a wrong answer must be right.
    It explains in great detail that another different DDD (same machine
    code different process context) seems to terminate only because the
    recursive emulation that it specifies has been aborted at its second recursive call.
    Yes! It really has different code, by way of the static Root variable.
    No wonder it behaves differently.

    You err because you fail to understand how the same C/x86 function
    invoked in a different process context can have different behavior.
    Do explain how a pure function can change.

    --
    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 joes@21:1/5 to All on Tue Oct 15 19:33:53 2024
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e When
    you click on the link and try to explain how HHH must be wrong when
    it reports that DDD does not terminate because DDD does terminate it >>>>> will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to justify
    why a wrong answer must be right.
    It explains in great detail that another different DDD (same machine
    code different process context) seems to terminate only because the
    recursive emulation that it specifies has been aborted at its second
    recursive call.
    Yes! It really has different code, by way of the static Root variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not a pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?

    Every termination analyzer that emulates itself emulating its input has always been a pure function of this input up to the point where
    emulation stops.
    That point can never come in the complete simulation of a non-
    terminating input, because it is infinite.

    You err because you fail to understand how the same C/x86 function
    invoked in a different process context can have different behavior.
    Do explain how a pure function can change.
    Non-terminating C functions do not ever return, thus cannot possibly be
    pure functions.
    By "pure" I mean having no side effects. You mean total vs. partial.

    HHH is a pure function of its input the whole time that it is emulating.
    DDD has no inputs and is allowed to be any finite string of x86 code.
    Inputs to HHH are by no means required to ever return AT ALL.
    I thought DDD was fixed to only call HHH(DDD)?

    --
    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 joes@21:1/5 to All on Tue Oct 15 21:24:06 2024
    Am Tue, 15 Oct 2024 15:01:36 -0500 schrieb olcott:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be
    wrong when it reports that DDD does not terminate because DDD does >>>>>>> terminate it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to
    justify why a wrong answer must be right.
    It explains in great detail that another different DDD (same machine >>>>> code different process context) seems to terminate only because the
    recursive emulation that it specifies has been aborted at its second >>>>> recursive call.
    Yes! It really has different code, by way of the static Root
    variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not a
    pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    I don't follow your repo. Can you point me to the relevant commit?
    It doesn't seem to have happened this year.

    Every termination analyzer that emulates itself emulating its input
    has always been a pure function of this input up to the point where
    emulation stops.
    That point can never come in the complete simulation of a non-
    terminating input, because it is infinite.
    You and Richard never seemed to understand this previously.
    You seemed to not understand that a simulation may be nonterminating.

    You err because you fail to understand how the same C/x86 function
    invoked in a different process context can have different behavior.
    Do explain how a pure function can change.
    Non-terminating C functions do not ever return, thus cannot possibly
    be pure functions.
    By "pure" I mean having no side effects. You mean total vs. partial.
    You may be half right. Only the analyzer must be pure.
    The input is free to get stuck in an infinite loop.
    Sure. How can a function without side effects have different behaviour?

    HHH is a pure function of its input the whole time that it is
    emulating.
    DDD has no inputs and is allowed to be any finite string of x86 code.
    Inputs to HHH are by no means required to ever return AT ALL.
    I thought DDD was fixed to only call HHH(DDD)?
    Inputs are not required to be pure functions.
    Weren't we discussing the halting DDD(){HHH(DDD);} before?

    --
    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 Damon@21:1/5 to olcott on Tue Oct 15 22:11:57 2024
    On 10/15/24 4:01 PM, olcott wrote:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e When >>>>>>> you click on the link and try to explain how HHH must be wrong when >>>>>>> it reports that DDD does not terminate because DDD does terminate it >>>>>>> will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to justify >>>>>> why a wrong answer must be right.
    It explains in great detail that another different DDD (same machine >>>>> code different process context) seems to terminate only because the
    recursive emulation that it specifies has been aborted at its second >>>>> recursive call.
    Yes! It really has different code, by way of the static Root variable. >>>> No wonder it behaves differently.
    There are no static root variables. There never has been any "not a pure >>> function of its inputs" aspect to emulation.

    Oh, did you take out the check if HHH is the root simulator?


    There is some code that was obsolete several years ago.

    No, that code is still active. it is the source of the value for the
    variable Root that is passed around, and is checked in the code to alter
    the behavior.


    Every termination analyzer that emulates itself emulating its input has
    always been a pure function of this input up to the point where
    emulation stops.

    That point can never come in the complete simulation of a non-
    terminating input, because it is infinite.

    You and Richard never seemed to understand this previously.

    But you don't understand the implications of that. A termination
    analyser can NOT be based on its own compete emulation of the input, and
    it can't use the fact that a different HHH looking at a DIFFERENT DDD
    (since for behavior purposes, DDD include the code of the HHH that it
    calls) to decide what this DDD does.


    You err because you fail to understand how the same C/x86 function
    invoked in a different process context can have different behavior.
    Do explain how a pure function can change.
    Non-terminating C functions do not ever return, thus cannot possibly be
    pure functions.

    By "pure" I mean having no side effects. You mean total vs. partial.


    You may be half right.
    https://en.wikipedia.org/wiki/Pure_function
    Only the analyzer must be pure.
    The input is free to get stuck in an infinite loop.

    Right, but it doesn't.


    HHH is a pure function of its input the whole time that it is emulating. >>> DDD has no inputs and is allowed to be any finite string of x86 code.
    Inputs to HHH are by no means required to ever return AT ALL.

    I thought DDD was fixed to only call HHH(DDD)?


    Inputs are not required to be pure functions.


    For Termination Analysis, maybe not, since it need to determine for ALL possible cases, which for non-pure functions include all external state
    value that might exist for it.

    But for Halt Deciding, since an input is specified, it does, but that
    isn't actually needed here since you are trying to distance yourself
    form it.

    But DDD MUST be a pure function, if it is to be a valid input for a
    termination analyser, as the Analyzer must be, and the code of DDD has
    nothing in itself that can break the purity. Now, if you exclude HHH for
    being part of DDD, then it isn't in the domain of valid inputs, since it
    isn't a complete program to be analysed.

    Non-pure functions still need to be fully code-defined, they can just
    use data that isn't defined as part of their inputs.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Tue Oct 15 22:12:09 2024
    On 10/15/24 2:25 PM, olcott wrote:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    ChatGPT does correctly apply truth preserving operations to the >>>>>>>>>>> premises that it was provided regarding the behavior of DDD and >>>>>>>>>>> HHH.
    *Try to find a mistake in its reasoning*
    No reasoning shown.
    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e >>>>>>>>> When you click on the link and try to explain how HHH must be >>>>>>>>> wrong when it reports that DDD does not terminate because DDD does >>>>>>>>> terminate it will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.
    The explanation is quite good. I will take what you said to mean >>>>>>> that it was over your head or didn't bother to look at it.
    You never confirmed that you even know what infinite recursion is. >>>>>> No, he means your argument is just non-sense, and it is just a
    blantant lie that you put forwards because you just don't understand >>>>>> what you are talking about.,
    In other words you coward away from trying to convince ChatGPT that is >>>>> is incorrect.
    What do you mean. With one statement I got it to admit that the ACTUAL >>>> behavior of DDD was to halt.


    Since you say that it is a YES man it should be easy for you to get it >>>>> to admit that it is wrong.
    Which I did,

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong
    when it reports that DDD does not terminate because DDD does terminate >>>>> it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to justify
    why a wrong answer must be right.
    It explains in great detail that another different DDD (same machine
    code different process context) seems to terminate only because the
    recursive emulation that it specifies has been aborted at its second
    recursive call.
    Yes! It really has different code, by way of the static Root variable.
    No wonder it behaves differently.


    There are no static root variables. There never has been any
    "not a pure function of its inputs" aspect to emulation.

    Really then where does the variable "Root" get its initial value from?

    Answer, it looks at global memory and see if it has the pre-fill value
    of 0x90909090 or not.

    Sorry, you are caught in that lie.

    And then that gets put into your "Root" varialbe, and the abort criteria
    is only evaluated if Root is true.


    Every termination analyzer that emulates itself emulating
    its input has always been a pure function of this input
    up to the point where emulation stops.

    Nope. you are just proving yourself to be a LIAR.

    It seems you don't understand what a "pure function" means.

    Note, unlike the term Computation, that if functional and not
    methodical, part of the definition of a "Pure Function" specifically
    outlaws certain code forms, like you program does.

    SO, even if it didn't change its behavior, the mere fact that it does
    this check makes it not a "pure function"


    You err because you fail to understand how the same C/x86 function
    invoked in a different process context can have different behavior.
    Do explain how a pure function can change.


    Non-terminating C functions do not ever return, thus cannot
    possibly be pure functions.

    But DDD does return, so can't be non-terminating.


    HHH is a pure function of its input the whole time that it
    is emulating.

    But that means it must ALWAYS return the same result for the same input,
    which means that the only correct conclusion of emulating a call
    HHH(DDD) instruction is to conclude that it returns.


    DDD has no inputs and is allowed to be any finite string
    of x86 code. Inputs to HHH are by no means required to ever
    return AT ALL. https://en.wikipedia.org/wiki/Pure_function



    But, for DDD to have the property of termination, it must represent a
    COMPLETE computation, which means it include full definition of all the
    code that it runs, and that includes the HHH that it calls.

    Since this DDD calls the exact same code as the HHH that returns 0 for
    the call to HHH(DDD), that code also returns 0 to that DDD, and thus
    that DDD is terminating.

    Only because HHH uses incorrect logic does it conclude that its input
    isn't terminationg.

    Part of that problem might be that it wasn't given a full input, or the
    problem might be that HHH does restrict itself to logic that remembers
    that the HHH that DDD calls is the HHH that is giving the answer, so
    when it hypotosizes that it is a different HHH that doesn't abort, it
    can't change the code for the HHH that DDD calls, like you logic tries
    to do, and thus is just unsound.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Oct 16 06:30:41 2024
    Am Tue, 15 Oct 2024 21:23:52 -0500 schrieb olcott:
    On 10/15/2024 9:11 PM, Richard Damon wrote:
    On 10/15/24 4:01 PM, olcott wrote:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e >>>>>>>>> When you click on the link and try to explain how HHH must be >>>>>>>>> wrong when it reports that DDD does not terminate because DDD >>>>>>>>> does terminate it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to
    justify why a wrong answer must be right.
    It explains in great detail that another different DDD (same
    machine code different process context) seems to terminate only
    because the recursive emulation that it specifies has been aborted >>>>>>> at its second recursive call.
    Yes! It really has different code, by way of the static Root
    variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not a
    pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    No, that code is still active. it is the source of the value for the
    variable Root that is passed around, and is checked in the code to
    alter the behavior.
    It has no effect on the trace itself.
    Other than producing a different trace. Seriously, why else should it
    be in there?

    It only affects the termination status decision that I conclusively
    prove is unequivocally correct no matter how HHH detects this.
    Sure, "DDD is the same program, except for a variable which directly
    changes termination" lol.

    --
    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 joes@21:1/5 to All on Wed Oct 16 06:33:11 2024
    Am Tue, 15 Oct 2024 16:51:15 -0500 schrieb olcott:
    On 10/15/2024 4:24 PM, joes wrote:
    Am Tue, 15 Oct 2024 15:01:36 -0500 schrieb olcott:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e >>>>>>>>> When you click on the link and try to explain how HHH must be >>>>>>>>> wrong when it reports that DDD does not terminate because DDD >>>>>>>>> does terminate it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to
    justify why a wrong answer must be right.
    It explains in great detail that another different DDD (same
    machine code different process context) seems to terminate only
    because the recursive emulation that it specifies has been aborted >>>>>>> at its second recursive call.
    Yes! It really has different code, by way of the static Root
    variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not a
    pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    I don't follow your repo. Can you point me to the relevant commit?
    It doesn't seem to have happened this year.
    https://github.com/plolcott/x86utm Halt7.c was updated last month.
    Nope, still there: https://github.com/plolcott/x86utm/blob/master/
    Halt7.c#L502

    Every termination analyzer that emulates itself emulating its input
    has always been a pure function of this input up to the point where
    emulation stops.
    That point can never come in the complete simulation of a non-
    terminating input, because it is infinite.
    You and Richard never seemed to understand this previously.
    You seemed to not understand that a simulation may be nonterminating.
    Sure yet only when the input is non-terminating.
    Sure.

    You err because you fail to understand how the same C/x86 function >>>>>>> invoked in a different process context can have different
    behavior.
    Do explain how a pure function can change.
    Non-terminating C functions do not ever return, thus cannot possibly >>>>> be pure functions.
    By "pure" I mean having no side effects. You mean total vs. partial.
    You may be half right. Only the analyzer must be pure.
    The input is free to get stuck in an infinite loop.
    Sure. How can a function without side effects have different behaviour?
    DDD is free to be totally screwed up every which way.
    It is only HHH that must be a pure function.
    In which way is DDD screwed up that it is both free of side effects and referentially intransparent?

    HHH is a pure function of its input the whole time that it is
    emulating.
    DDD has no inputs and is allowed to be any finite string of x86
    code.
    Inputs to HHH are by no means required to ever return AT ALL.
    I thought DDD was fixed to only call HHH(DDD)?
    Inputs are not required to be pure functions.
    Weren't we discussing the halting DDD(){HHH(DDD);} before?
    For many months now I have been talking about the termination analyzer
    HHH applied to input DDD.
    I am not aware of ever referring to HHH as a halt decider. When I talk
    about halt deciders I talk about the Linz proof.
    I am, as of a couple months back. This is still related to the Linz proof.

    --
    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 Damon@21:1/5 to olcott on Wed Oct 16 07:44:38 2024
    On 10/15/24 10:23 PM, olcott wrote:
    On 10/15/2024 9:11 PM, Richard Damon wrote:
    On 10/15/24 4:01 PM, olcott wrote:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e >>>>>>>>> When
    you click on the link and try to explain how HHH must be wrong >>>>>>>>> when
    it reports that DDD does not terminate because DDD does
    terminate it
    will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to
    justify
    why a wrong answer must be right.
    It explains in great detail that another different DDD (same machine >>>>>>> code different process context) seems to terminate only because the >>>>>>> recursive emulation that it specifies has been aborted at its second >>>>>>> recursive call.
    Yes! It really has different code, by way of the static Root
    variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not a
    pure
    function of its inputs" aspect to emulation.

    Oh, did you take out the check if HHH is the root simulator?


    There is some code that was obsolete several years ago.

    No, that code is still active. it is the source of the value for the
    variable Root that is passed around, and is checked in the code to
    alter the behavior.


    It has no effect on the trace itself.

    Yes it does.

    Your full trace of the emulation of DDD by HHH shows that HHH emulates
    itself making a decision based on the value of that flag.


    It only effects the termination status decision
    that I conclusively prove is unequivocally correct
    no matter how HHH detects this.

    Nope, just prove that you logic is based on lying,


    Every HHH that returns 0 correctly reports that DDD
    emulated by HHH cannot possible reach its own return
    instruction EVEN IF HHH DOES THIS BY WILD GUESS.

    But the DDD does reach the final return statement, just not in the
    emulation done by HHH.

    An aborted emulation can't be used by itself of evidence of
    non-termination, so you are just showing that you are insisting on using equivocation to assert your incorrect answer.


    Of every HHH that returns anything at all, the
    ones that return 0 are necessarily correct.


    Nope, not if they are to be termination analysers by the industry
    standard definitions, as their input will halt.

    Thus, you are just showing that your whole argument is based on lies and deception.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Oct 16 13:27:11 2024
    Am Wed, 16 Oct 2024 07:26:37 -0500 schrieb olcott:
    On 10/16/2024 1:30 AM, joes wrote:
    Am Tue, 15 Oct 2024 21:23:52 -0500 schrieb olcott:
    On 10/15/2024 9:11 PM, Richard Damon wrote:
    On 10/15/24 4:01 PM, olcott wrote:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott: >>>>>>>>>>>>>>> On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e >>>>>>>>>>> When you click on the link and try to explain how HHH must be >>>>>>>>>>> wrong when it reports that DDD does not terminate because DDD >>>>>>>>>>> does terminate it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to >>>>>>>>>> justify why a wrong answer must be right.
    It explains in great detail that another different DDD (same >>>>>>>>> machine code different process context) seems to terminate only >>>>>>>>> because the recursive emulation that it specifies has been
    aborted at its second recursive call.
    Yes! It really has different code, by way of the static Root
    variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not >>>>>>> a pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    No, that code is still active. it is the source of the value for the
    variable Root that is passed around, and is checked in the code to
    alter the behavior.
    It has no effect on the trace itself.
    Other than producing a different trace. Seriously, why else should it
    be in there?
    The whole purpose of the root variable to for storing and examining the trace. It has nothing to do with the actual x86 emulation.
    Nope. It is a flag for checking if we are in the outermost simulator.

    It only affects the termination status decision that I conclusively
    prove is unequivocally correct no matter how HHH detects this.
    Sure, "DDD is the same program, except for a variable which directly
    changes termination" lol.
    Without the root variable the trace would be the exact same trace
    (except not terminate) thus the root variable has no effect what-so-ever
    on the claim that I have been consistently making for several weeks.
    Exactly! It is only for changing the answer HHH gives about DDD. That
    changes the whole trace except for the first few instructions. What was
    your claim again?

    --
    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 joes@21:1/5 to All on Wed Oct 16 14:01:38 2024
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:
    Am Tue, 15 Oct 2024 16:51:15 -0500 schrieb olcott:
    On 10/15/2024 4:24 PM, joes wrote:
    Am Tue, 15 Oct 2024 15:01:36 -0500 schrieb olcott:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:
    On 10/14/2024 6:50 PM, Richard Damon wrote:
    On 10/14/24 11:18 AM, olcott wrote:
    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott: >>>>>>>>>>>>>>> On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e >>>>>>>>>>> When you click on the link and try to explain how HHH must be >>>>>>>>>>> wrong when it reports that DDD does not terminate because DDD >>>>>>>>>>> does terminate it will explain your mistake to you.
    I did that, and it admitted that DDD halts, it just tries to >>>>>>>>>> justify why a wrong answer must be right.
    It explains in great detail that another different DDD (same >>>>>>>>> machine code different process context) seems to terminate only >>>>>>>>> because the recursive emulation that it specifies has been
    aborted at its second recursive call.
    Yes! It really has different code, by way of the static Root
    variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any "not >>>>>>> a pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    I don't follow your repo. Can you point me to the relevant commit?
    It doesn't seem to have happened this year.
    https://github.com/plolcott/x86utm Halt7.c was updated last month.
    Nope, still there: https://github.com/plolcott/x86utm/blob/master/
    Halt7.c#L502
    https://github.com/plolcott/x86utm/blob/master/Halt7.c#L502 shows: u32
    H(ptr P, ptr I) // 2024-09-15 was HH and edit on line 643
    The repository indicates that it was updated: "last month"
    Line 502 (if(Root)) wasn't changed.

    Every termination analyzer that emulates itself emulating its
    input has always been a pure function of this input up to the
    point where emulation stops.
    That point can never come in the complete simulation of a non-
    terminating input, because it is infinite.
    You and Richard never seemed to understand this previously.
    You seemed to not understand that a simulation may be nonterminating.
    Sure yet only when the input is non-terminating.
    Sure.
    Therefore if HHH even guesses that its input is non-termination then HHH
    is correct.

    You err because you fail to understand how the same C/x86
    function invoked in a different process context can have
    different behavior.
    Do explain how a pure function can change.
    Non-terminating C functions do not ever return, thus cannot
    possibly be pure functions.
    By "pure" I mean having no side effects. You mean total vs.
    partial.
    You may be half right. Only the analyzer must be pure.
    The input is free to get stuck in an infinite loop.
    Sure. How can a function without side effects have different
    behaviour?
    DDD is free to be totally screwed up every which way.
    It is only HHH that must be a pure function.
    In which way is DDD screwed up that it is both free of side effects and
    referentially intransparent?
    In other words you don't have a clue that an input to a termination
    analyzer can be non-terminating thus violating the (1) criteria of pure functions shown below.
    I am talking about the referential transparency, not whether the function
    is total or partial.
    https://en.wikipedia.org/wiki/Total_functional_programming

    (1) *the function return values are identical for identical arguments*
    (no variation with local static variables, non-local variables, mutable reference arguments or input streams, i.e., referential transparency),
    and (2) the function has no side effects (no mutation of local static variables, non-local variables, mutable reference arguments or input/
    output streams).
    Yes, this has nothing to do with termination. Your function Decide_Halting_HH(..., u32 Root) (line 473) is not pure though.

    When-so-ever any input to a termination analyzer is
    non-terminating for any reason then this input is not a pure function.
    s/pure/total

    Terminating C functions must reach their "return" statement.
    Which DDD does.

    HHH is a pure function of its input the whole time that it is
    emulating.
    DDD has no inputs and is allowed to be any finite string of x86
    code.
    Inputs to HHH are by no means required to ever return AT ALL.
    I thought DDD was fixed to only call HHH(DDD)?
    Inputs are not required to be pure functions.
    Weren't we discussing the halting DDD(){HHH(DDD);} before?
    For many months now I have been talking about the termination analyzer
    HHH applied to input DDD.
    I am not aware of ever referring to HHH as a halt decider. When I talk
    about halt deciders I talk about the Linz proof.
    I am, as of a couple months back. This is still related to the Linz
    proof.
    --
    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 joes@21:1/5 to All on Wed Oct 16 14:45:09 2024
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:
    Am Tue, 15 Oct 2024 16:51:15 -0500 schrieb olcott:
    On 10/15/2024 4:24 PM, joes wrote:
    Am Tue, 15 Oct 2024 15:01:36 -0500 schrieb olcott:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:

    It explains in great detail that another different DDD (same >>>>>>>>>>> machine code different process context) seems to terminate >>>>>>>>>>> only because the recursive emulation that it specifies has >>>>>>>>>>> been aborted at its second recursive call.
    Yes! It really has different code, by way of the static Root >>>>>>>>>> variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any >>>>>>>>> "not a pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    I don't follow your repo. Can you point me to the relevant commit? >>>>>> It doesn't seem to have happened this year.
    https://github.com/plolcott/x86utm Halt7.c was updated last month.
    Nope, still there: https://github.com/plolcott/x86utm/blob/master/
    Halt7.c#L502
    https://github.com/plolcott/x86utm/blob/master/Halt7.c#L502 shows: u32
    H(ptr P, ptr I) // 2024-09-15 was HH and edit on line 643 The
    repository indicates that it was updated: "last month"
    Line 502 (if(Root)) wasn't changed.

    You err because you fail to understand how the same C/x86 >>>>>>>>>>> function invoked in a different process context can have >>>>>>>>>>> different behavior.
    Do explain how a pure function can change.
    Non-terminating C functions do not ever return, thus cannot
    possibly be pure functions.
    By "pure" I mean having no side effects. You mean total vs.
    partial.
    You may be half right. Only the analyzer must be pure.
    The input is free to get stuck in an infinite loop.
    Sure. How can a function without side effects have different
    behaviour?
    DDD is free to be totally screwed up every which way.
    It is only HHH that must be a pure function.
    In which way is DDD screwed up that it is both free of side effects
    and referentially intransparent?
    In other words you don't have a clue that an input to a termination
    analyzer can be non-terminating thus violating the (1) criteria of
    pure functions shown below.
    I am talking about the referential transparency, not whether the
    function is total or partial.

    (1) *the function return values are identical for identical arguments*
    (no variation with local static variables, non-local variables,
    mutable reference arguments or input streams, i.e., referential
    transparency), and (2) the function has no side effects (no mutation
    of local static variables, non-local variables, mutable reference
    arguments or input/ output streams).
    Yes, this has nothing to do with termination. Your function
    Decide_Halting_HH(..., u32 Root) (line 473) is not pure though.

    When-so-ever any input to a termination analyzer is non-terminating
    for any reason then this input is not a pure function.
    s/pure/total

    Terminating C functions must reach their "return" statement.
    Which DDD does.

    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is stipulated that *correct_x86_emulation* means that a finite string of x86 instructions
    is emulated according to the semantics of the x86 language beginning
    with the first bytes of this string.
    You are not simulating the given program, but a version that differs
    in the abort check.

    When HHH is an x86 emulation based termination analyzer then each DDD *correctly_emulated_by* any HHH that it calls never returns.
    It is not a correct emulation if it has a different termination status.

    --
    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 joes@21:1/5 to All on Wed Oct 16 14:48:17 2024
    Am Wed, 16 Oct 2024 08:55:57 -0500 schrieb olcott:
    On 10/16/2024 8:27 AM, joes wrote:
    Am Wed, 16 Oct 2024 07:26:37 -0500 schrieb olcott:
    On 10/16/2024 1:30 AM, joes wrote:
    Am Tue, 15 Oct 2024 21:23:52 -0500 schrieb olcott:
    On 10/15/2024 9:11 PM, Richard Damon wrote:
    On 10/15/24 4:01 PM, olcott wrote:
    On 10/15/2024 2:33 PM, joes wrote:
    Am Tue, 15 Oct 2024 13:25:36 -0500 schrieb olcott:
    On 10/15/2024 10:17 AM, joes wrote:
    Am Tue, 15 Oct 2024 08:11:30 -0500 schrieb olcott:
    On 10/15/2024 6:35 AM, Richard Damon wrote:
    On 10/14/24 10:13 PM, olcott wrote:

    It explains in great detail that another different DDD (same >>>>>>>>>>> machine code different process context) seems to terminate >>>>>>>>>>> only because the recursive emulation that it specifies has >>>>>>>>>>> been aborted at its second recursive call.
    Yes! It really has different code, by way of the static Root >>>>>>>>>> variable.
    No wonder it behaves differently.
    There are no static root variables. There never has been any >>>>>>>>> "not a pure function of its inputs" aspect to emulation.
    Oh, did you take out the check if HHH is the root simulator?
    There is some code that was obsolete several years ago.
    No, that code is still active. it is the source of the value for
    the variable Root that is passed around, and is checked in the code >>>>>> to alter the behavior.
    It has no effect on the trace itself.
    Other than producing a different trace. Seriously, why else should it
    be in there?
    The whole purpose of the root variable to for storing and examining
    the trace. It has nothing to do with the actual x86 emulation.
    Nope. It is a flag for checking if we are in the outermost simulator.
    This has no effect on the sequence of correctly emulated steps.
    It only has an effect of the length of this sequence.
    Two sequences of different lengths are not the same, even though they
    may be the same up to the penultimate instruction, which must be a
    return in the shorter one, while the longer continues.

    At the time that HHH aborts its emulation there is already complete
    proof that it was required to abort this sequence to prevent its own non-termination.
    The fact that it aborts changes the answer, by virtue of the recursive simulation.

    We are only quibbling over whether or not it saw this complete proof in
    the proper way.
    No, it does not give the right answer.

    It only affects the termination status decision that I conclusively
    prove is unequivocally correct no matter how HHH detects this.
    Sure, "DDD is the same program, except for a variable which directly
    changes termination" lol.
    Without the root variable the trace would be the exact same trace
    (except not terminate) thus the root variable has no effect
    what-so-ever on the claim that I have been consistently making for
    several weeks.
    Exactly! It is only for changing the answer HHH gives about DDD.

    That changes the whole trace except for the first few instructions.
    It does not change any aspect of the trace until the trace conclusively proves that DDD cannot possibly ever reach its own "return" instruction
    no matter what HHH does.
    It changes the trace of HHH to abort simulating.

    --
    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 Mikko@21:1/5 to olcott on Wed Oct 16 19:30:04 2024
    On 2024-10-15 12:49:33 +0000, olcott said:

    On 10/15/2024 3:27 AM, Mikko wrote:
    On 2024-10-14 09:49:22 +0000, olcott said:

    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:
    https://en.wikipedia.org/wiki/Hallucination_(artificial_intelligence) >>>>>
    ChatGPT does correctly apply truth preserving operations to
    the premises that it was provided regarding the behavior of
    DDD and HHH. *Try to find a mistake in its reasoning*

    No reasoning shown.


    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e

    When you click on the link and try to explain how HHH must
    be wrong when it reports that DDD does not terminate because
    DDD does terminate it will explain your mistake to you.

    Possibly, but you have not shown any reasoning. The only relevant
    things on the page behind the link is:


    Everything after the first page is reasoning provided
    by ChatGPT. Everything that I provide after the first
    page merely challenges the reasoning provided by ChatGPT.

    Right now the linked page shows no discussion.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Wed Oct 16 19:23:36 2024
    On 2024-10-15 12:57:25 +0000, olcott said:

    On 10/15/2024 3:33 AM, Mikko wrote:
    On 2024-10-14 15:18:43 +0000, olcott said:

    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:

    ChatGPT does correctly apply truth preserving operations to the
    premises that it was provided regarding the behavior of DDD and HHH. >>>>>>> *Try to find a mistake in its reasoning*

    No reasoning shown.

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be wrong when >>>>> it reports that DDD does not terminate because DDD does terminate it >>>>> will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.

    The explanation is quite good. I will take what you said
    to mean that it was over your head or didn't bother to
    look at it.

    You never confirmed that you even know what infinite
    recursion is.

    Could you confirm that you know whether there is an infinite recursion
    in DDD?


    Recursive emulation is isomorphic to recursion.

    The following is to be understood only within my
    stipulative definitions of terms provided in my first
    reply to you today.

    Recursive emulation that does not have a termination
    condition within the c function under test is infinite.

    This refers to my stipulative definition of terms
    provided in my first reply to you. To the best of my
    knowledge these definitions are also industry standard.

    This can be interpreted as an overly verbose 'No'.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Oct 16 17:27:13 2024
    Am Wed, 16 Oct 2024 10:39:21 -0500 schrieb olcott:
    On 10/16/2024 9:45 AM, joes wrote:
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:
    Am Tue, 15 Oct 2024 16:51:15 -0500 schrieb olcott:
    On 10/15/2024 4:24 PM, joes wrote:

    Terminating C functions must reach their "return" statement.
    Which DDD does.
    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is stipulated that
    *correct_x86_emulation* means that a finite string of x86 instructions
    is emulated according to the semantics of the x86 language beginning
    with the first bytes of this string.
    You are not simulating the given program, but a version that differs in
    the abort check.
    HHH is correctly emulating (not simulating) the x86 language finite
    string of DDD including emulating the finite string of itself emulating
    the finite string of DDD up until the point where the emulated emulated
    DDD would call HHH(DDD) again.
    Whereupon the simulated HHH would abort, if it weren't unnecessarily
    aborted.

    When HHH is an x86 emulation based termination analyzer then each DDD
    *correctly_emulated_by* any HHH that it calls never returns.
    It is not a correct emulation if it has a different termination status.
    --
    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 joes@21:1/5 to All on Wed Oct 16 18:06:40 2024
    Am Wed, 16 Oct 2024 12:46:01 -0500 schrieb olcott:
    On 10/16/2024 12:27 PM, joes wrote:
    Am Wed, 16 Oct 2024 10:39:21 -0500 schrieb olcott:
    On 10/16/2024 9:45 AM, joes wrote:
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:
    Am Tue, 15 Oct 2024 16:51:15 -0500 schrieb olcott:
    On 10/15/2024 4:24 PM, joes wrote:

    Terminating C functions must reach their "return" statement.
    Which DDD does.
    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is stipulated that
    *correct_x86_emulation* means that a finite string of x86
    instructions is emulated according to the semantics of the x86
    language beginning with the first bytes of this string.
    You are not simulating the given program, but a version that differs
    in the abort check.
    HHH is correctly emulating (not simulating) the x86 language finite
    string of DDD including emulating the finite string of itself
    emulating the finite string of DDD up until the point where the
    emulated emulated DDD would call HHH(DDD) again.
    Whereupon the simulated HHH would abort, if it weren't unnecessarily
    aborted.
    If the first HHH to meet its abort criteria does not act on this
    criteria then none of them do.
    And if the first one does, all of them do.

    When HHH is an x86 emulation based termination analyzer then each
    DDD *correctly_emulated_by* any HHH that it calls never returns.
    It is not a correct emulation if it has a different termination
    status.
    --
    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 joes@21:1/5 to All on Wed Oct 16 18:47:22 2024
    Am Wed, 16 Oct 2024 13:35:01 -0500 schrieb olcott:
    On 10/16/2024 1:06 PM, joes wrote:
    Am Wed, 16 Oct 2024 12:46:01 -0500 schrieb olcott:
    On 10/16/2024 12:27 PM, joes wrote:
    Am Wed, 16 Oct 2024 10:39:21 -0500 schrieb olcott:
    On 10/16/2024 9:45 AM, joes wrote:
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:

    Terminating C functions must reach their "return" statement.
    Which DDD does.
    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is stipulated
    that *correct_x86_emulation* means that a finite string of x86
    instructions is emulated according to the semantics of the x86
    language beginning with the first bytes of this string.
    You are not simulating the given program, but a version that
    differs in the abort check.
    HHH is correctly emulating (not simulating) the x86 language finite
    string of DDD including emulating the finite string of itself
    emulating the finite string of DDD up until the point where the
    emulated emulated DDD would call HHH(DDD) again.
    Whereupon the simulated HHH would abort, if it weren't unnecessarily
    aborted.
    If the first HHH to meet its abort criteria does not act on this
    criteria then none of them do.
    And if the first one does, all of them do.
    In theory this seems true when ignoring or failing to comprehend key
    details.
    In practice you programmed H impurely.

    When HHH is an x86 emulation based termination analyzer then each >>>>>>> DDD *correctly_emulated_by* any HHH that it calls never returns.
    It is not a correct emulation if it has a different termination
    status.
    --
    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 joes@21:1/5 to All on Wed Oct 16 19:33:35 2024
    Am Wed, 16 Oct 2024 13:59:58 -0500 schrieb olcott:
    On 10/16/2024 1:47 PM, joes wrote:
    Am Wed, 16 Oct 2024 13:35:01 -0500 schrieb olcott:
    On 10/16/2024 1:06 PM, joes wrote:
    Am Wed, 16 Oct 2024 12:46:01 -0500 schrieb olcott:
    On 10/16/2024 12:27 PM, joes wrote:
    Am Wed, 16 Oct 2024 10:39:21 -0500 schrieb olcott:
    On 10/16/2024 9:45 AM, joes wrote:
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:

    Terminating C functions must reach their "return" statement. >>>>>>>>>> Which DDD does.
    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is stipulated >>>>>>>>> that *correct_x86_emulation* means that a finite string of x86 >>>>>>>>> instructions is emulated according to the semantics of the x86 >>>>>>>>> language beginning with the first bytes of this string.
    You are not simulating the given program, but a version that
    differs in the abort check.
    HHH is correctly emulating (not simulating) the x86 language
    finite string of DDD including emulating the finite string of
    itself emulating the finite string of DDD up until the point where >>>>>>> the emulated emulated DDD would call HHH(DDD) again.
    Whereupon the simulated HHH would abort, if it weren't
    unnecessarily aborted.
    If the first HHH to meet its abort criteria does not act on this
    criteria then none of them do.
    And if the first one does, all of them do.
    In theory this seems true when ignoring or failing to comprehend key
    details.
    In practice you programmed H impurely.
    Which totally does not matter to the slightest degree when you have the discipline to stay within the precisely designated scope of the exact
    words that I am saying.
    When HHH is an x86 emulation based termination analyzer then each DDD *correctly_emulated_by* any HHH that it calls cannot possibly return no matter what this HHH does.
    Exactly, because your nested HHHs do not abort.

    When HHH is an x86 emulation based termination analyzer then >>>>>>>>> each DDD *correctly_emulated_by* any HHH that it calls never >>>>>>>>> returns.
    It is not a correct emulation if it has a different termination >>>>>>>> status.
    --
    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 joes@21:1/5 to All on Wed Oct 16 20:02:41 2024
    Am Wed, 16 Oct 2024 14:39:37 -0500 schrieb olcott:
    On 10/16/2024 2:33 PM, joes wrote:
    Am Wed, 16 Oct 2024 13:59:58 -0500 schrieb olcott:
    On 10/16/2024 1:47 PM, joes wrote:
    Am Wed, 16 Oct 2024 13:35:01 -0500 schrieb olcott:
    On 10/16/2024 1:06 PM, joes wrote:
    Am Wed, 16 Oct 2024 12:46:01 -0500 schrieb olcott:
    On 10/16/2024 12:27 PM, joes wrote:
    Am Wed, 16 Oct 2024 10:39:21 -0500 schrieb olcott:
    On 10/16/2024 9:45 AM, joes wrote:
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott:
    On 10/16/2024 1:33 AM, joes wrote:

    Terminating C functions must reach their "return" statement. >>>>>>>>>>>> Which DDD does.
    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is stipulated >>>>>>>>>>> that *correct_x86_emulation* means that a finite string of x86 >>>>>>>>>>> instructions is emulated according to the semantics of the x86 >>>>>>>>>>> language beginning with the first bytes of this string.
    You are not simulating the given program, but a version that >>>>>>>>>> differs in the abort check.
    HHH is correctly emulating (not simulating) the x86 language >>>>>>>>> finite string of DDD including emulating the finite string of >>>>>>>>> itself emulating the finite string of DDD up until the point >>>>>>>>> where the emulated emulated DDD would call HHH(DDD) again.
    Whereupon the simulated HHH would abort, if it weren't
    unnecessarily aborted.
    If the first HHH to meet its abort criteria does not act on this >>>>>>> criteria then none of them do.
    And if the first one does, all of them do.
    In theory this seems true when ignoring or failing to comprehend key >>>>> details.
    In practice you programmed H impurely.
    Which totally does not matter to the slightest degree when you have
    the discipline to stay within the precisely designated scope of the
    exact words that I am saying.
    When HHH is an x86 emulation based termination analyzer then each DDD
    *correctly_emulated_by* any HHH that it calls cannot possibly return
    no matter what this HHH does.
    Exactly, because your nested HHHs do not abort.
    In other words you continue to fail to understand that unless the first
    one aborts then none of them can possibly abort because they all have
    the exact same code.
    Then HHH should report itself as halting, when they would all abort.

    When HHH is an x86 emulation based termination analyzer then >>>>>>>>>>> each DDD *correctly_emulated_by* any HHH that it calls never >>>>>>>>>>> returns.
    It is not a correct emulation if it has a different termination >>>>>>>>>> status.
    --
    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 Damon@21:1/5 to olcott on Wed Oct 16 20:06:05 2024
    On 10/16/24 12:39 PM, olcott wrote:
    On 10/16/2024 11:23 AM, Mikko wrote:
    On 2024-10-15 12:57:25 +0000, olcott said:

    On 10/15/2024 3:33 AM, Mikko wrote:
    On 2024-10-14 15:18:43 +0000, olcott said:

    On 10/14/2024 7:06 AM, joes wrote:
    Am Mon, 14 Oct 2024 04:49:22 -0500 schrieb olcott:
    On 10/14/2024 4:04 AM, Mikko wrote:
    On 2024-10-13 12:53:12 +0000, olcott said:

    Although it is possible for LLM systems to lie:

    ChatGPT does correctly apply truth preserving operations to the >>>>>>>>> premises that it was provided regarding the behavior of DDD and >>>>>>>>> HHH.
    *Try to find a mistake in its reasoning*

    No reasoning shown.

    https://chatgpt.com/share/6709e046-4794-8011-98b7-27066fb49f3e
    When you click on the link and try to explain how HHH must be
    wrong when
    it reports that DDD does not terminate because DDD does terminate it >>>>>>> will explain your mistake to you.
    It is nonsensical for HHH not to report that DDD terminates.

    The explanation is quite good. I will take what you said
    to mean that it was over your head or didn't bother to
    look at it.

    You never confirmed that you even know what infinite
    recursion is.

    Could you confirm that you know whether there is an infinite recursion >>>> in DDD?


    Recursive emulation is isomorphic to recursion.

    The following is to be understood only within my
    stipulative definitions of terms provided in my first
    reply to you today.

    Recursive emulation that does not have a termination
    condition within the c function under test is infinite.

    This refers to my stipulative definition of terms
    provided in my first reply to you. To the best of my
    knowledge these definitions are also industry standard.

    This can be interpreted as an overly verbose 'No'.


    I will equally say that you are wrong.


    WHich just proves that you know you have no correct basis for your
    claims and know you are just a pathological liar.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Oct 17 10:07:27 2024
    Am Wed, 16 Oct 2024 15:06:01 -0500 schrieb olcott:
    On 10/16/2024 3:02 PM, joes wrote:
    Am Wed, 16 Oct 2024 14:39:37 -0500 schrieb olcott:
    On 10/16/2024 2:33 PM, joes wrote:
    Am Wed, 16 Oct 2024 13:59:58 -0500 schrieb olcott:
    On 10/16/2024 1:47 PM, joes wrote:
    Am Wed, 16 Oct 2024 13:35:01 -0500 schrieb olcott:
    On 10/16/2024 1:06 PM, joes wrote:
    Am Wed, 16 Oct 2024 12:46:01 -0500 schrieb olcott:
    On 10/16/2024 12:27 PM, joes wrote:
    Am Wed, 16 Oct 2024 10:39:21 -0500 schrieb olcott:
    On 10/16/2024 9:45 AM, joes wrote:
    Am Wed, 16 Oct 2024 09:11:22 -0500 schrieb olcott:
    On 10/16/2024 9:01 AM, joes wrote:
    Am Wed, 16 Oct 2024 08:31:43 -0500 schrieb olcott: >>>>>>>>>>>>>>> On 10/16/2024 1:33 AM, joes wrote:

    Terminating C functions must reach their "return" >>>>>>>>>>>>>>> statement.
    Which DDD does.
    THIS IS ALSO THE INDUSTRY STANDARD DEFINITION It is
    stipulated that *correct_x86_emulation* means that a finite >>>>>>>>>>>>> string of x86 instructions is emulated according to the >>>>>>>>>>>>> semantics of the x86 language beginning with the first bytes >>>>>>>>>>>>> of this string.
    You are not simulating the given program, but a version that >>>>>>>>>>>> differs in the abort check.
    HHH is correctly emulating (not simulating) the x86 language >>>>>>>>>>> finite string of DDD including emulating the finite string of >>>>>>>>>>> itself emulating the finite string of DDD up until the point >>>>>>>>>>> where the emulated emulated DDD would call HHH(DDD) again. >>>>>>>>>> Whereupon the simulated HHH would abort, if it weren't
    unnecessarily aborted.
    If the first HHH to meet its abort criteria does not act on this >>>>>>>>> criteria then none of them do.
    And if the first one does, all of them do.
    In theory this seems true when ignoring or failing to comprehend >>>>>>> key details.
    In practice you programmed H impurely.
    Which totally does not matter to the slightest degree when you have
    the discipline to stay within the precisely designated scope of the
    exact words that I am saying.
    When HHH is an x86 emulation based termination analyzer then each
    DDD *correctly_emulated_by* any HHH that it calls cannot possibly
    return no matter what this HHH does.
    Exactly, because your nested HHHs do not abort.
    In other words you continue to fail to understand that unless the
    first one aborts then none of them can possibly abort because they all
    have the exact same code.
    Then HHH should report itself as halting, when they would all abort.
    They would not all abort when you pay close attention to ALL of the
    details. It is utterly impossible for any of them besides the outermost
    one to abort because it aborts before any of the rest of them see their
    abort criteria has been met.
    Only because they aren't simulated. But they are still terminating
    programs. An infinite loop is still non-halting even if I never run it.

    --
    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)