• Re: DD specifies non-terminating behavior to HHH --- ONE POINT AT A TIM

    From joes@21:1/5 to All on Tue Feb 18 16:50:31 2025
    Am Tue, 18 Feb 2025 10:34:45 -0600 schrieb olcott:
    On 2/18/2025 7:48 AM, joes wrote:
    Am Tue, 18 Feb 2025 07:37:54 -0600 schrieb olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott:
    On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said:
    On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote:
    On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>> normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>> shows that HHH does not return 0. If it does DD also >>>>>>>>>>>>>>> returns 0.
    When we are referring to the above DD simulated by HHH and >>>>>>>>>>>>>> not trying to get away with changing the subject to some >>>>>>>>>>>>>> other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>> knows that no instance of DD shown above simulated by any >>>>>>>>>>>>>> corresponding instance of HHH can possibly terminate >>>>>>>>>>>>>> normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>
    A simulating termination analyzer correctly rejects any input >>>>>>>>>>>> that must be aborted to prevent its own non-termination. >>>>>>>>>>> Yes, in particular itself is not such an input, because we >>>>>>>>>>> *know* that it halts, because it is a decider. You can’t have >>>>>>>>>>> your cake and eat it too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally".
    DD correctly simulated by HHH cannot possibly terminate
    normally.
    What’s confusing about „halts”? I find it clearer as it does not
    imply an ambiguous „abnormal termination”. How does HHH simulate >>>>>>>>> DD terminating abnormally, then? Why doesn’t it terminate
    abnormally itself?
    You can substitute the term: the input DD to HHH does not need >>>>>>>>> to be aborted, because the simulated decider terminates.

    Every simulated input that must be aborted to prevent the
    non-termination of HHH is stipulated to be correctly rejected by >>>>>>>> HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>
    Unless HHH(DD) aborts its simulation of DD itself cannot possibly
    terminate normally. Every expert in the C programming language can
    see this. People that are not experts get confused by the loop after >>>>> the "if" statement.

    So? Since it does that, it needs to presume that the copy of itself
    it sees called does that.

    Not at all.
    I mean, this is a deterministic program without any static variables,
    amirite?

    When I focus on one single-point:
    [D simulated by HHH cannot possibly terminate normally]
    I get two years of dodging and this point is never addressed.
    Way to derail.

    Since there is about a 7% chance that my very drastic cancer treatment
    will kill me in the next 100 days I must insist on 100% perfectly and completely addressing this point before moving on to any other points.
    Oh right, I wanted to wait a month for your 5% chance. When exactly is it?

    Here is the point that you just missed Unless the first HHH that sees
    the non-terminating pattern aborts its simulation none of them do
    because they all have the exact same code.
    --
    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 Feb 18 18:33:44 2025
    On 2/18/25 11:34 AM, olcott wrote:
    On 2/18/2025 7:48 AM, joes wrote:
    Am Tue, 18 Feb 2025 07:37:54 -0600 schrieb olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott:
    On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said:
    On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote:
    On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>> normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>> shows that HHH does not return 0. If it does DD also returns >>>>>>>>>>>>>>> 0.
    When we are referring to the above DD simulated by HHH and >>>>>>>>>>>>>> not trying to get away with changing the subject to some >>>>>>>>>>>>>> other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming knows >>>>>>>>>>>>>> that no instance of DD shown above simulated by any >>>>>>>>>>>>>> corresponding instance of HHH can possibly terminate >>>>>>>>>>>>>> normally.
    Well, then that corresponding (by what?) HHH isn’t a decider. >>>>>>>>>>>> I am focusing on the isomorphic notion of a termination >>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>
    A simulating termination analyzer correctly rejects any input >>>>>>>>>>>> that must be aborted to prevent its own non-termination. >>>>>>>>>>> Yes, in particular itself is not such an input, because we >>>>>>>>>>> *know* that it halts, because it is a decider. You can’t have >>>>>>>>>>> your cake and eat it too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally".
    DD correctly simulated by HHH cannot possibly terminate normally. >>>>>>>>> What’s confusing about „halts”? I find it clearer as it does not
    imply an ambiguous „abnormal termination”. How does HHH simulate >>>>>>>>> DD terminating abnormally, then? Why doesn’t it terminate
    abnormally itself?
    You can substitute the term: the input DD to HHH does not need to >>>>>>>>> be aborted, because the simulated decider terminates.

    Every simulated input that must be aborted to prevent the
    non-termination of HHH is stipulated to be correctly rejected by >>>>>>>> HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>
    Unless HHH(DD) aborts its simulation of DD itself cannot possibly
    terminate normally. Every expert in the C programming language can see >>>>> this. People that are not experts get confused by the loop after the >>>>> "if" statement.

    So? Since it does that, it needs to presume that the copy of itself it >>>> sees called does that.

    Not at all.
    I mean, this is a deterministic program without any static variables,
    amirite?


    When I focus on one single-point:
    [D simulated by HHH cannot possibly terminate normally]
    I get two years of dodging and this point is never addressed.

    And you thus miss the point that what the partial simulation by HHH does
    is irerelvent, except to your strawman.


    Since there is about a 7% chance that my very drastic cancer
    treatment will kill me in the next 100 days I must insist on
    100% perfectly and completely addressing this point before
    moving on to any other points.

    And thus the world has about 7% chance of ridding itself of a lying
    fraud soon.

    You NEED to insist on using CORRECT definitions so you can redeam your reputation from all your lies.


    Here is the point that you just missed Unless the first HHH that sees
    the non-terminating pattern aborts its simulation none of them do
    because they all have the exact same code.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Tue Feb 18 18:36:11 2025
    On 2/18/25 11:48 AM, olcott wrote:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott:
    On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said:
    On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote:
    On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>> normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>> shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH and >>>>>>>>>>>>>> not
    trying to get away with changing the subject to some other DD >>>>>>>>>>>>>> somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any corresponding >>>>>>>>>>>>>> instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a decider. >>>>>>>>>>>> I am focusing on the isomorphic notion of a termination >>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>
    A simulating termination analyzer correctly rejects any >>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination.
    Yes, in particular itself is not such an input, because we >>>>>>>>>>> *know* that
    it halts, because it is a decider. You can’t have your cake >>>>>>>>>>> and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally".
    DD correctly simulated by HHH cannot possibly terminate normally. >>>>>>>>> What’s confusing about „halts”? I find it clearer as it does >>>>>>>>> not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>> terminating abnormally, then? Why doesn’t it terminate abnormally >>>>>>>>> itself?
    You can substitute the term: the input DD to HHH does not need >>>>>>>>> to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>

    Unless HHH(DD) aborts its simulation of DD itself cannot possibly
    terminate normally. Every expert in the C programming language
    can see this. People that are not experts get confused by the loop
    after the "if" statement.


    So? Since it does that, it needs to presume that the copy of itself
    it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is changed
    to abort the simulation, the program is changed. He does not
    understand that a modification of a program makes a change. Such a
    change modifies the behaviour of the program. The non-termination
    behaviour has disappeared with this change and only remains in his
    dreams. After this change, the simulation would terminate normally and
    HHH should no longer abort. But it does, because the code that detects
    the 'special condition' has a bug, which makes that it does not see
    that the program has been changed into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]


    A STRAWMAN!!!

    And thus showing that you logic is a FRAUD.


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

    Which fails to be the representation of a "Program" since it doesn't
    include all of the code it uses.

    And when you add the full halt7.c file, you lose the right to change HHH
    to be something else.

    Thus, AGAIN, your logic is shown to be based on FRAUD.


    int main()
    {
      HHH(Infinite_Recursion);
      HHH(DDD);
    }

    Since there is about a 7% chance that my very drastic cancer
    treatment will kill me in the next 100 days I must insist on
    100% perfectly and completely addressing this point before
    moving on to any other points.


    And the world a 7% chance of getting rid of a FRAUD.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Wed Feb 19 11:55:45 2025
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott:
    On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said:
    On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote:
    On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>> normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>> shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH and >>>>>>>>>>>>>> not
    trying to get away with changing the subject to some other DD >>>>>>>>>>>>>> somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any corresponding >>>>>>>>>>>>>> instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a decider. >>>>>>>>>>>> I am focusing on the isomorphic notion of a termination >>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>
    A simulating termination analyzer correctly rejects any >>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination.
    Yes, in particular itself is not such an input, because we >>>>>>>>>>> *know* that
    it halts, because it is a decider. You can’t have your cake >>>>>>>>>>> and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally".
    DD correctly simulated by HHH cannot possibly terminate normally. >>>>>>>>> What’s confusing about „halts”? I find it clearer as it does >>>>>>>>> not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>> terminating abnormally, then? Why doesn’t it terminate abnormally >>>>>>>>> itself?
    You can substitute the term: the input DD to HHH does not need >>>>>>>>> to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>

    Unless HHH(DD) aborts its simulation of DD itself cannot possibly
    terminate normally. Every expert in the C programming language
    can see this. People that are not experts get confused by the loop
    after the "if" statement.


    So? Since it does that, it needs to presume that the copy of itself
    it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is changed
    to abort the simulation, the program is changed. He does not
    understand that a modification of a program makes a change. Such a
    change modifies the behaviour of the program. The non-termination
    behaviour has disappeared with this change and only remains in his
    dreams. After this change, the simulation would terminate normally and
    HHH should no longer abort. But it does, because the code that detects
    the 'special condition' has a bug, which makes that it does not see
    that the program has been changed into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
      HHH(Infinite_Recursion);
      HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott ignores
    it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program DD
    up to the end because it is logically impossible for it to complete the simulation, it still fails. If the logically impossible cannot be done,
    we can admit that HHH's simulation fails to complete the impossible task.
    So, why is Olcott trying to fix the logically impossible? He could as
    well try to draw a square circle.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Feb 19 07:03:23 2025
    On 2/18/25 11:10 PM, olcott wrote:
    On 2/18/2025 5:33 PM, Richard Damon wrote:
    On 2/18/25 11:34 AM, olcott wrote:
    On 2/18/2025 7:48 AM, joes wrote:
    Am Tue, 18 Feb 2025 07:37:54 -0600 schrieb olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>>>> normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>>>> shows that HHH does not return 0. If it does DD also >>>>>>>>>>>>>>>>> returns
    0.
    When we are referring to the above DD simulated by HHH and >>>>>>>>>>>>>>>> not trying to get away with changing the subject to some >>>>>>>>>>>>>>>> other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>> knows
    that no instance of DD shown above simulated by any >>>>>>>>>>>>>>>> corresponding instance of HHH can possibly terminate >>>>>>>>>>>>>>>> normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>>>
    A simulating termination analyzer correctly rejects any input >>>>>>>>>>>>>> that must be aborted to prevent its own non-termination. >>>>>>>>>>>>> Yes, in particular itself is not such an input, because we >>>>>>>>>>>>> *know* that it halts, because it is a decider. You can’t have >>>>>>>>>>>>> your cake and eat it too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it does not
    imply an ambiguous „abnormal termination”. How does HHH simulate
    DD terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>> abnormally itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>> need to
    be aborted, because the simulated decider terminates.

    Every simulated input that must be aborted to prevent the
    non-termination of HHH is stipulated to be correctly rejected by >>>>>>>>>> HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>>>
    Unless HHH(DD) aborts its simulation of DD itself cannot possibly >>>>>>> terminate normally. Every expert in the C programming language
    can see
    this. People that are not experts get confused by the loop after the >>>>>>> "if" statement.

    So? Since it does that, it needs to presume that the copy of
    itself it
    sees called does that.

    Not at all.
    I mean, this is a deterministic program without any static variables,
    amirite?


    When I focus on one single-point:
    [D simulated by HHH cannot possibly terminate normally]
    I get two years of dodging and this point is never addressed.

    And you thus miss the point that what the partial simulation by HHH
    does is irerelvent, except to your strawman.


    SAYING THAT IT IS IRRELEVANT PROVIDES ZERO EVIDENCE THAT IT IS FALSE


    So you admit to using the logic of a strawman!

    Since it *IS* irrelevent, its truth value doesn't affect the truth value
    of the proposition.

    All you are doing is admitting that you whole work is nothing but a
    FRAUD based on strawmen and lies.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Feb 19 21:14:08 2025
    On 2/19/25 7:34 PM, olcott wrote:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>>>> shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any
    corresponding instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>>>
    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>> Yes, in particular itself is not such an input, because we >>>>>>>>>>>>> *know* that
    it halts, because it is a decider. You can’t have your cake >>>>>>>>>>>>> and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it does >>>>>>>>>>> not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>>>> terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>> need to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>>>

    Unless HHH(DD) aborts its simulation of DD itself cannot possibly >>>>>>> terminate normally. Every expert in the C programming language
    can see this. People that are not experts get confused by the loop >>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of
    itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does not
    understand that a modification of a program makes a change. Such a
    change modifies the behaviour of the program. The non-termination
    behaviour has disappeared with this change and only remains in his
    dreams. After this change, the simulation would terminate normally
    and HHH should no longer abort. But it does, because the code that
    detects the 'special condition' has a bug, which makes that it does
    not see that the program has been changed into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program
    DD up to the end because it is logically impossible for it to complete
    the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.


    But no one asks for that, because it is meaningless.

    Asking if a program will halt is not meaningless.

    A fact that you disturbed mind can't understand, because to acknoldge
    that truth would require you to admit to yourself that you have been
    nothing but a stupid ignorant liar for all these years.

    You just don't understand what is needed to make problem similar enough
    to make that sort of analogy, but that requires the ability to actually
    REASON.



    If the logically impossible cannot be done, we can admit that HHH's
    simulation fails to complete the impossible task.
    So, why is Olcott trying to fix the logically impossible? He could as
    well try to draw a square circle.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Feb 20 09:52:55 2025
    Am Wed, 19 Feb 2025 18:34:14 -0600 schrieb olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>>>> shows that HHH does not return 0. If it does DD also >>>>>>>>>>>>>>>>> returns 0.
    When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>> and not trying to get away with changing the subject to >>>>>>>>>>>>>>>> some other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>> knows that no instance of DD shown above simulated by any >>>>>>>>>>>>>>>> corresponding instance of HHH can possibly terminate >>>>>>>>>>>>>>>> normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination
    analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>> input that must be aborted to prevent its own
    non-termination.
    Yes, in particular itself is not such an input, because we >>>>>>>>>>>>> *know* that it halts, because it is a decider. You can’t >>>>>>>>>>>>> have your cake and eat it too.
    I am not even using the confusing term "halts". Instead I am >>>>>>>>>>>> using in its place "terminates normally". DD correctly >>>>>>>>>>>> simulated by HHH cannot possibly terminate normally.
    What’s confusing about „halts”? I find it clearer as it does >>>>>>>>>>> not imply an ambiguous „abnormal termination”. How does HHH >>>>>>>>>>> simulate DD terminating abnormally, then? Why doesn’t it >>>>>>>>>>> terminate abnormally itself?
    You can substitute the term: the input DD to HHH does not need >>>>>>>>>>> to be aborted, because the simulated decider terminates. >>>>>>>>>>>
    Every simulated input that must be aborted to prevent the
    non-termination of HHH is stipulated to be correctly rejected >>>>>>>>>> by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary
    meaning.

    Unless HHH(DD) aborts its simulation of DD itself cannot possibly >>>>>>> terminate normally. Every expert in the C programming language can >>>>>>> see this. People that are not experts get confused by the loop
    after the "if" statement.

    So? Since it does that, it needs to presume that the copy of itself >>>>>> it sees called does that.

    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.
    Here is the point that you just missed Unless the first HHH that
    sees the non-terminating pattern aborts its simulation none of them
    do because they all have the exact same code.

    The point Olcott misses is that if the non-terminating HHH is changed
    to abort the simulation, the program is changed. He does not
    understand that a modification of a program makes a change. Such a
    change modifies the behaviour of the program. The non-termination
    behaviour has disappeared with this change and only remains in his
    dreams. After this change, the simulation would terminate normally
    and HHH should no longer abort. But it does, because the code that
    detects the 'special condition' has a bug, which makes that it does
    not see that the program has been changed into a halting program.

    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.
    [DD simulated by HHH cannot possibly terminate normally]

    It is not true that this point has never been addressed. Olcott ignores
    it when it is addressed.
    What is the point? Even if HHH fails to simulate the halting program DD
    up to the end because it is logically impossible for it to complete the
    simulation, it still fails.

    It fails In the same way that every CAD system will never correctly
    represent a geometric circle that has four equal length sides in the
    same two dimensional plane.
    Yes, no program will ever decide the halting status of every program.

    If the logically impossible cannot be done,
    we can admit that HHH's simulation fails to complete the impossible
    task.
    So, why is Olcott trying to fix the logically impossible? He could as
    well try to draw a square circle.
    --
    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 Thu Feb 20 09:56:01 2025
    Am Wed, 19 Feb 2025 20:56:17 -0600 schrieb olcott:
    On 2/19/2025 8:14 PM, Richard Damon wrote:
    On 2/19/25 7:34 PM, olcott wrote:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>> above shows that HHH does not return 0. If it does DD >>>>>>>>>>>>>>>>>>> also returns 0.
    When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>> and not trying to get away with changing the subject to >>>>>>>>>>>>>>>>>> some other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>> knows that no instance of DD shown above simulated by >>>>>>>>>>>>>>>>>> any corresponding instance of HHH can possibly >>>>>>>>>>>>>>>>>> terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>> input that must be aborted to prevent its own
    non-termination.
    Yes, in particular itself is not such an input, because we >>>>>>>>>>>>>>> *know* that it halts, because it is a decider. You can’t >>>>>>>>>>>>>>> have your cake and eat it too.
    I am not even using the confusing term "halts". Instead I >>>>>>>>>>>>>> am using in its place "terminates normally". DD correctly >>>>>>>>>>>>>> simulated by HHH cannot possibly terminate normally. >>>>>>>>>>>>> What’s confusing about „halts”? I find it clearer as it does
    not imply an ambiguous „abnormal termination”. How does HHH >>>>>>>>>>>>> simulate DD terminating abnormally, then? Why doesn’t it >>>>>>>>>>>>> terminate abnormally itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>> need to be aborted, because the simulated decider
    terminates.

    Every simulated input that must be aborted to prevent the >>>>>>>>>>>> non-termination of HHH is stipulated to be correctly rejected >>>>>>>>>>>> by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary
    meaning.

    Unless HHH(DD) aborts its simulation of DD itself cannot
    possibly terminate normally. Every expert in the C programming >>>>>>>>> language can see this. People that are not experts get confused >>>>>>>>> by the loop after the "if" statement.

    So? Since it does that, it needs to presume that the copy of
    itself it sees called does that.

    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.
    Here is the point that you just missed Unless the first HHH that >>>>>>> sees the non-terminating pattern aborts its simulation none of
    them do because they all have the exact same code.

    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does
    not understand that a modification of a program makes a change.
    Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only
    remains in his dreams. After this change, the simulation would
    terminate normally and HHH should no longer abort. But it does,
    because the code that detects the 'special condition' has a bug,
    which makes that it does not see that the program has been changed >>>>>> into a halting program.

    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.
    [DD simulated by HHH cannot possibly terminate normally]

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.
    What is the point? Even if HHH fails to simulate the halting program
    DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system will never correctly
    represent a geometric circle that has four equal length sides in the
    same two dimensional plane.

    But no one asks for that, because it is meaningless.
    Asking if a program will halt is not meaningless.

    When is formulated to be a self-contradictory it is the same as the CAD requirement.
    Self-contradiction doesn’t depend on the formulation.

    --
    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 Fred. Zwarts@21:1/5 to All on Thu Feb 20 10:35:14 2025
    Op 20.feb.2025 om 01:34 schreef olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott:
    On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said:
    On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote:
    On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said:

    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>>>> shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any
    corresponding instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination analysers.) >>>>>>>>>>>>>
    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>> Yes, in particular itself is not such an input, because we >>>>>>>>>>>>> *know* that
    it halts, because it is a decider. You can’t have your cake >>>>>>>>>>>>> and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it does >>>>>>>>>>> not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>>>> terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>> need to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary meaning. >>>>>>>>

    Unless HHH(DD) aborts its simulation of DD itself cannot possibly >>>>>>> terminate normally. Every expert in the C programming language
    can see this. People that are not experts get confused by the loop >>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of
    itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does not
    understand that a modification of a program makes a change. Such a
    change modifies the behaviour of the program. The non-termination
    behaviour has disappeared with this change and only remains in his
    dreams. After this change, the simulation would terminate normally
    and HHH should no longer abort. But it does, because the code that
    detects the 'special condition' has a bug, which makes that it does
    not see that the program has been changed into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program
    DD up to the end because it is logically impossible for it to complete
    the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.



    Indeed. Such a CAD system fails if it is given the task to draw a square circle. Similarly, HHH fails if it is given the task to determine the termination behaviour of DD.
    We can't blame them, because they cannot possibly complete the
    impossible task. We only blame the one that is trying do something that
    has been proven that it cannot possibly work.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Thu Feb 20 07:19:42 2025
    On 2/19/25 9:56 PM, olcott wrote:
    On 2/19/2025 8:14 PM, Richard Damon wrote:
    On 2/19/25 7:34 PM, olcott wrote:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>> above shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>> corresponding instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>>>> Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>> we *know* that
    it halts, because it is a decider. You can’t have your >>>>>>>>>>>>>>> cake and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it >>>>>>>>>>>>> does not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>>>>>> terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>> need to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary
    meaning.


    Unless HHH(DD) aborts its simulation of DD itself cannot
    possibly terminate normally. Every expert in the C programming >>>>>>>>> language
    can see this. People that are not experts get confused by the loop >>>>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of
    itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does
    not understand that a modification of a program makes a change.
    Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only
    remains in his dreams. After this change, the simulation would
    terminate normally and HHH should no longer abort. But it does,
    because the code that detects the 'special condition' has a bug,
    which makes that it does not see that the program has been changed >>>>>> into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program
    DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.


    But no one asks for that, because it is meaningless.

    Asking if a program will halt is not meaningless.


    When is formulated to be a self-contradictory it is the
    same as the CAD requirement.


    But it isn't.

    The question is:

    Does this program Halt when Run


    That question has a definite Yes or No, if it *IS* a program.

    For the DD in question (with the HHH that you claim to make it a
    program) the answer is YES.

    Your problem is you make the input not a program, because you don't
    understand what that means.

    The fact that your HHH GIVES UPS AND LIES before being able to determine
    that, because YOU LIE as to what question it is actually trying to
    answer, just shows your ignorance.

    Sorry, but your stupidity becomes obvious to anyone with a bear minimum
    of intelegence, something you clearly don't have.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mr Flibble@21:1/5 to richard@damon-family.org on Thu Feb 20 17:42:49 2025
    On Thu, 20 Feb 2025 07:19:42 -0500, Richard Damon
    <richard@damon-family.org> wrote:

    On 2/19/25 9:56 PM, olcott wrote:
    On 2/19/2025 8:14 PM, Richard Damon wrote:
    On 2/19/25 7:34 PM, olcott wrote:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott: >>>>>>>>>>>>>>> On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>>
    DD correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>>> above shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>>> corresponding instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isnt a >>>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>>>>> Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>>> we *know* that
    it halts, because it is a decider. You cant have your >>>>>>>>>>>>>>>> cake and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>> normally.
    Whats confusing about halts? I find it clearer as it >>>>>>>>>>>>>> does not imply
    an ambiguous abnormal termination. How does HHH simulate DD >>>>>>>>>>>>>> terminating abnormally, then? Why doesnt it terminate >>>>>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>>> need to be
    aborted, because the simulated decider terminates. >>>>>>>>>>>>>>

    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
    int Halt_Status = HHH(DD);
    if (Halt_Status)
    HERE: goto HERE;
    return Halt_Status;
    }

    int main()
    {
    HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary >>>>>>>>>>> meaning.


    Unless HHH(DD) aborts its simulation of DD itself cannot
    possibly terminate normally. Every expert in the C programming >>>>>>>>>> language
    can see this. People that are not experts get confused by the loop >>>>>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of >>>>>>>>> itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully >>>>>>>> deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does >>>>>>> not understand that a modification of a program makes a change.
    Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only
    remains in his dreams. After this change, the simulation would
    terminate normally and HHH should no longer abort. But it does,
    because the code that detects the 'special condition' has a bug, >>>>>>> which makes that it does not see that the program has been changed >>>>>>> into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
    HHH(Infinite_Recursion);
    HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program >>>>> DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.


    But no one asks for that, because it is meaningless.

    Asking if a program will halt is not meaningless.


    When is formulated to be a self-contradictory it is the
    same as the CAD requirement.


    But it isn't.

    The question is:

    Does this program Halt when Run


    That question has a definite Yes or No, if it *IS* a program.

    For the DD in question (with the HHH that you claim to make it a
    program) the answer is YES.

    Your problem is you make the input not a program, because you don't >understand what that means.

    The fact that your HHH GIVES UPS AND LIES before being able to determine >that, because YOU LIE as to what question it is actually trying to
    answer, just shows your ignorance.

    Sorry, but your stupidity becomes obvious to anyone with a bear minimum
    of intelegence, something you clearly don't have.

    Ah, the ad hominem attack; does that ever work?

    /Flibble

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to Mr Flibble on Fri Feb 21 10:15:47 2025
    On 2025-02-20 17:42:49 +0000, Mr Flibble said:

    On Thu, 20 Feb 2025 07:19:42 -0500, Richard Damon
    <richard@damon-family.org> wrote:

    On 2/19/25 9:56 PM, olcott wrote:
    On 2/19/2025 8:14 PM, Richard Damon wrote:
    On 2/19/25 7:34 PM, olcott wrote:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>>>> above shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>>>> corresponding instance
    of HHH can possibly terminate normally. >>>>>>>>>>>>>>>>>>> Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>>>>>> Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>>>> we *know* that
    it halts, because it is a decider. You can’t have your >>>>>>>>>>>>>>>>> cake and eat it
    too.
    I am not even using the confusing term "halts". >>>>>>>>>>>>>>>> Instead I am using in its place "terminates normally". >>>>>>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it >>>>>>>>>>>>>>> does not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>>>>>>>> terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>>>> need to be
    aborted, because the simulated decider terminates. >>>>>>>>>>>>>>>

    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating. >>>>>>>>>>>>>>
    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary >>>>>>>>>>>> meaning.


    Unless HHH(DD) aborts its simulation of DD itself cannot >>>>>>>>>>> possibly terminate normally. Every expert in the C programming >>>>>>>>>>> language
    can see this. People that are not experts get confused by the loop >>>>>>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of >>>>>>>>>> itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully >>>>>>>>> deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does >>>>>>>> not understand that a modification of a program makes a change. >>>>>>>> Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only >>>>>>>> remains in his dreams. After this change, the simulation would >>>>>>>> terminate normally and HHH should no longer abort. But it does, >>>>>>>> because the code that detects the 'special condition' has a bug, >>>>>>>> which makes that it does not see that the program has been changed >>>>>>>> into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program >>>>>> DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.


    But no one asks for that, because it is meaningless.

    Asking if a program will halt is not meaningless.


    When is formulated to be a self-contradictory it is the
    same as the CAD requirement.


    But it isn't.

    The question is:

    Does this program Halt when Run


    That question has a definite Yes or No, if it *IS* a program.

    For the DD in question (with the HHH that you claim to make it a
    program) the answer is YES.

    Your problem is you make the input not a program, because you don't
    understand what that means.

    The fact that your HHH GIVES UPS AND LIES before being able to determine
    that, because YOU LIE as to what question it is actually trying to
    answer, just shows your ignorance.

    Sorry, but your stupidity becomes obvious to anyone with a bear minimum
    of intelegence, something you clearly don't have.

    Ah, the ad hominem attack; does that ever work?

    It is not an attack. It is an informative comment, formally to the author
    of the previous message but actually to all readers. Whether it works
    depends on each reader, and so does whether it needs to work.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Feb 21 20:05:38 2025
    On 2/21/25 6:15 PM, olcott wrote:
    On 2/20/2025 3:35 AM, Fred. Zwarts wrote:
    Op 20.feb.2025 om 01:34 schreef olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>> above shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>> corresponding instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>>>> Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>> we *know* that
    it halts, because it is a decider. You can’t have your >>>>>>>>>>>>>>> cake and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it >>>>>>>>>>>>> does not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>>>>>> terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>> need to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary
    meaning.


    Unless HHH(DD) aborts its simulation of DD itself cannot
    possibly terminate normally. Every expert in the C programming >>>>>>>>> language
    can see this. People that are not experts get confused by the loop >>>>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of
    itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does
    not understand that a modification of a program makes a change.
    Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only
    remains in his dreams. After this change, the simulation would
    terminate normally and HHH should no longer abort. But it does,
    because the code that detects the 'special condition' has a bug,
    which makes that it does not see that the program has been changed >>>>>> into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program
    DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.



    Indeed. Such a CAD system fails if it is given the task to draw a
    square circle. Similarly, HHH fails if it is given the task to
    determine the termination behaviour of DD.

    It DOES NOT FAIL when it is defined coherently.
    The square root of a basket of rotten eggs is also not computable.

    Except you haven't shown a "coherent" definition, since your logic is
    based on variable constants and claims based on lies.

    All you are doing is showing your utter ignorance of what you talk
    about, and that you are nothing but an ignorant pathological lying fraud.


    We can't blame them, because they cannot possibly complete the
    impossible task. We only blame the one that is trying do something
    that has been proven that it cannot possibly work.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Sat Feb 22 10:38:12 2025
    Op 22.feb.2025 om 04:57 schreef olcott:
    On 2/20/2025 3:52 AM, joes wrote:
    Am Wed, 19 Feb 2025 18:34:14 -0600 schrieb olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing above >>>>>>>>>>>>>>>>>>> shows that HHH does not return 0. If it does DD also >>>>>>>>>>>>>>>>>>> returns 0.
    When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>> and not trying to get away with changing the subject to >>>>>>>>>>>>>>>>>> some other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>> knows that no instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>> corresponding instance of HHH can possibly terminate >>>>>>>>>>>>>>>>>> normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>> input that must be aborted to prevent its own
    non-termination.
    Yes, in particular itself is not such an input, because we >>>>>>>>>>>>>>> *know* that it halts, because it is a decider. You can’t >>>>>>>>>>>>>>> have your cake and eat it too.
    I am not even using the confusing term "halts". Instead I am >>>>>>>>>>>>>> using in its place "terminates normally". DD correctly >>>>>>>>>>>>>> simulated by HHH cannot possibly terminate normally. >>>>>>>>>>>>> What’s confusing about „halts”? I find it clearer as it does
    not imply an ambiguous „abnormal termination”. How does HHH >>>>>>>>>>>>> simulate DD terminating abnormally, then? Why doesn’t it >>>>>>>>>>>>> terminate abnormally itself?
    You can substitute the term: the input DD to HHH does not need >>>>>>>>>>>>> to be aborted, because the simulated decider terminates. >>>>>>>>>>>>>
    Every simulated input that must be aborted to prevent the >>>>>>>>>>>> non-termination of HHH is stipulated to be correctly rejected >>>>>>>>>>>> by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary
    meaning.

    Unless HHH(DD) aborts its simulation of DD itself cannot possibly >>>>>>>>> terminate normally. Every expert in the C programming language can >>>>>>>>> see this. People that are not experts get confused by the loop >>>>>>>>> after the "if" statement.

    So? Since it does that, it needs to presume that the copy of itself >>>>>>>> it sees called does that.

    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.
    Here is the point that you just missed Unless the first HHH that >>>>>>> sees the non-terminating pattern aborts its simulation none of them >>>>>>> do because they all have the exact same code.

    The point Olcott misses is that if the non-terminating HHH is changed >>>>>> to abort the simulation, the program is changed. He does not
    understand that a modification of a program makes a change. Such a >>>>>> change modifies the behaviour of the program. The non-termination
    behaviour has disappeared with this change and only remains in his >>>>>> dreams. After this change, the simulation would terminate normally >>>>>> and HHH should no longer abort. But it does, because the code that >>>>>> detects the 'special condition' has a bug, which makes that it does >>>>>> not see that the program has been changed into a halting program.

    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.
    [DD simulated by HHH cannot possibly terminate normally]

    It is not true that this point has never been addressed. Olcott ignores >>>> it when it is addressed.
    What is the point? Even if HHH fails to simulate the halting program DD >>>> up to the end because it is logically impossible for it to complete the >>>> simulation, it still fails.

    It fails In the same way that every CAD system will never correctly
    represent a geometric circle that has four equal length sides in the
    same two dimensional plane.
    Yes, no program will ever decide the halting status of every program.


    In the exact same way that the square root of
    a basket of rotten eggs is not computable.

    Exactly, both are logically impossible. So, stop the attempt to do what
    is logically impossible. Stop working on a halting decider. And stop
    trying to program a correct simulation of HHH by itself. It is logically impossible. It as promising as working on the computation of the square
    root of a basket of rotten eggs.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Fred. Zwarts@21:1/5 to All on Sat Feb 22 10:34:06 2025
    Op 22.feb.2025 om 00:15 schreef olcott:
    On 2/20/2025 3:35 AM, Fred. Zwarts wrote:
    Op 20.feb.2025 om 01:34 schreef olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott:
    On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote:
    On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>> above shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>>>> When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>> and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>> knows that no
    instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>> corresponding instance
    of HHH can possibly terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>> input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>>>> Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>> we *know* that
    it halts, because it is a decider. You can’t have your >>>>>>>>>>>>>>> cake and eat it
    too.
    I am not even using the confusing term "halts".
    Instead I am using in its place "terminates normally". >>>>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it >>>>>>>>>>>>> does not imply
    an ambiguous „abnormal termination”. How does HHH simulate DD >>>>>>>>>>>>> terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>> need to be
    aborted, because the simulated decider terminates.


    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary
    meaning.


    Unless HHH(DD) aborts its simulation of DD itself cannot
    possibly terminate normally. Every expert in the C programming >>>>>>>>> language
    can see this. People that are not experts get confused by the loop >>>>>>>>> after the "if" statement.


    So? Since it does that, it needs to presume that the copy of
    itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully
    deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does
    not understand that a modification of a program makes a change.
    Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only
    remains in his dreams. After this change, the simulation would
    terminate normally and HHH should no longer abort. But it does,
    because the code that detects the 'special condition' has a bug,
    which makes that it does not see that the program has been changed >>>>>> into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting program
    DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.



    Indeed. Such a CAD system fails if it is given the task to draw a
    square circle. Similarly, HHH fails if it is given the task to
    determine the termination behaviour of DD.

    It DOES NOT FAIL when it is defined coherently.
    The square root of a basket of rotten eggs is also not computable.

    Therefore it is stupid to give something the task to compute the square
    root of a basket of rotten eggs. Similarly, it is equally stupid to try
    the impossible task of letting HHH simulate itself.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Sat Feb 22 07:15:12 2025
    On 2/21/25 10:57 PM, olcott wrote:
    On 2/20/2025 3:56 AM, joes wrote:
    Am Wed, 19 Feb 2025 20:56:17 -0600 schrieb olcott:
    On 2/19/2025 8:14 PM, Richard Damon wrote:
    On 2/19/25 7:34 PM, olcott wrote:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>>>> above shows that HHH does not return 0. If it does DD >>>>>>>>>>>>>>>>>>>>> also returns 0.
    When we are referring to the above DD simulated by HHH >>>>>>>>>>>>>>>>>>>> and not trying to get away with changing the subject to >>>>>>>>>>>>>>>>>>>> some other DD somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C programming >>>>>>>>>>>>>>>>>>>> knows that no instance of DD shown above simulated by >>>>>>>>>>>>>>>>>>>> any corresponding instance of HHH can possibly >>>>>>>>>>>>>>>>>>>> terminate normally.
    Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a termination >>>>>>>>>>>>>>>>>> analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>>>> input that must be aborted to prevent its own >>>>>>>>>>>>>>>>>> non-termination.
    Yes, in particular itself is not such an input, because we >>>>>>>>>>>>>>>>> *know* that it halts, because it is a decider. You can’t >>>>>>>>>>>>>>>>> have your cake and eat it too.
    I am not even using the confusing term "halts". Instead I >>>>>>>>>>>>>>>> am using in its place "terminates normally". DD correctly >>>>>>>>>>>>>>>> simulated by HHH cannot possibly terminate normally. >>>>>>>>>>>>>>> What’s confusing about „halts”? I find it clearer as it does
    not imply an ambiguous „abnormal termination”. How does HHH >>>>>>>>>>>>>>> simulate DD terminating abnormally, then? Why doesn’t it >>>>>>>>>>>>>>> terminate abnormally itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>>>> need to be aborted, because the simulated decider >>>>>>>>>>>>>>> terminates.

    Every simulated input that must be aborted to prevent the >>>>>>>>>>>>>> non-termination of HHH is stipulated to be correctly rejected >>>>>>>>>>>>>> by HHH as non-terminating.

    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary >>>>>>>>>>>> meaning.

    Unless HHH(DD) aborts its simulation of DD itself cannot >>>>>>>>>>> possibly terminate normally. Every expert in the C programming >>>>>>>>>>> language can see this. People that are not experts get confused >>>>>>>>>>> by the loop after the "if" statement.

    So? Since it does that, it needs to presume that the copy of >>>>>>>>>> itself it sees called does that.

    Not at all. Perhaps your technical skill is much more woefully >>>>>>>>> deficient than I ever imagined.
    Here is the point that you just missed Unless the first HHH that >>>>>>>>> sees the non-terminating pattern aborts its simulation none of >>>>>>>>> them do because they all have the exact same code.

    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does >>>>>>>> not understand that a modification of a program makes a change. >>>>>>>> Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only >>>>>>>> remains in his dreams. After this change, the simulation would >>>>>>>> terminate normally and HHH should no longer abort. But it does, >>>>>>>> because the code that detects the 'special condition' has a bug, >>>>>>>> which makes that it does not see that the program has been changed >>>>>>>> into a halting program.

    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.
    [DD simulated by HHH cannot possibly terminate normally]

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.
    What is the point? Even if HHH fails to simulate the halting program >>>>>> DD up to the end because it is logically impossible for it to
    complete the simulation, it still fails.

    It fails In the same way that every CAD system will never correctly
    represent a geometric circle that has four equal length sides in the >>>>> same two dimensional plane.

    But no one asks for that, because it is meaningless.
    Asking if a program will halt is not meaningless.

    When is formulated to be a self-contradictory it is the same as the CAD
    requirement.
    Self-contradiction doesn’t depend on the formulation.


    Mere ignorance on your part.


    No, it shows the ignorance on *YOUR* part.

    It seems you just don't the meaning of the words, so you don't
    understand the "formulation".

    Since you have shown you don't even know what a "program" means, or
    "truth", you have no basis to make you claims.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Feb 22 16:45:15 2025
    Am Sat, 22 Feb 2025 10:28:34 -0600 schrieb olcott:
    On 2/22/2025 3:34 AM, Fred. Zwarts wrote:
    Op 22.feb.2025 om 00:15 schreef olcott:
    On 2/20/2025 3:35 AM, Fred. Zwarts wrote:
    Op 20.feb.2025 om 01:34 schreef olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:
    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said:

    A simulating termination analyzer correctly rejects any >>>>>>>>>>>>>>>>>> input that must be aborted to prevent its own >>>>>>>>>>>>>>>>>> non-termination.
    Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>>>> we *know* that it halts, because it is a decider. You >>>>>>>>>>>>>>>>> can’t have your cake and eat it too.
    I am not even using the confusing term "halts". Instead I >>>>>>>>>>>>>>>> am using in its place "terminates normally". DD correctly >>>>>>>>>>>>>>>> simulated by HHH cannot possibly terminate normally. >>>>>>>>>>>>>>> What’s confusing about „halts”? I find it clearer as it >>>>>>>>>>>>>>> does not imply an ambiguous „abnormal termination”. How >>>>>>>>>>>>>>> does HHH simulate DD terminating abnormally, then? Why >>>>>>>>>>>>>>> doesn’t it terminate abnormally itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>>>> need to be aborted, because the simulated decider >>>>>>>>>>>>>>> terminates.
    Every simulated input that must be aborted to prevent the >>>>>>>>>>>>>> non-termination of HHH is stipulated to be correctly >>>>>>>>>>>>>> rejected by HHH as non-terminating.
    A very strange and invalid stipulation.
    It merely means that the words do not have their ordinary >>>>>>>>>>>> meaning.
    Unless HHH(DD) aborts its simulation of DD itself cannot >>>>>>>>>>> possibly terminate normally. Every expert in the C programming >>>>>>>>>>> language can see this. People that are not experts get
    confused by the loop after the "if" statement.
    So? Since it does that, it needs to presume that the copy of >>>>>>>>>> itself it sees called does that.
    Not at all. Perhaps your technical skill is much more woefully >>>>>>>>> deficient than I ever imagined.
    Here is the point that you just missed Unless the first HHH that >>>>>>>>> sees the non-terminating pattern aborts its simulation none of >>>>>>>>> them do because they all have the exact same code.
    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does >>>>>>>> not understand that a modification of a program makes a change. >>>>>>>> Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only >>>>>>>> remains in his dreams. After this change, the simulation would >>>>>>>> terminate normally and HHH should no longer abort. But it does, >>>>>>>> because the code that detects the 'special condition' has a bug, >>>>>>>> which makes that it does not see that the program has been
    changed into a halting program.
    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.
    [DD simulated by HHH cannot possibly terminate normally]
    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.
    What is the point? Even if HHH fails to simulate the halting
    program DD up to the end because it is logically impossible for it >>>>>> to complete the simulation, it still fails.
    It fails In the same way that every CAD system will never correctly
    represent a geometric circle that has four equal length sides in the >>>>> same two dimensional plane.
    Indeed. Such a CAD system fails if it is given the task to draw a
    square circle. Similarly, HHH fails if it is given the task to
    determine the termination behaviour of DD.
    It DOES NOT FAIL when it is defined coherently.
    The square root of a basket of rotten eggs is also not computable.
    Therefore it is stupid to give something the task to compute the square
    root of a basket of rotten eggs. Similarly, it is equally stupid to try
    the impossible task of letting HHH simulate itself.
    Because the code proves that HHH does simulate itself correctly it is
    not stupid for HHH to simulate itself. This was the most difficult
    aspect of creating the x86utm operating system.
    No, the code proves that HHH simulates a different version that doesn't
    abort. See line 1059.

    --
    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 Sat Feb 22 18:17:03 2025
    Am Sat, 22 Feb 2025 12:07:17 -0600 schrieb olcott:
    On 2/22/2025 10:45 AM, joes wrote:
    Am Sat, 22 Feb 2025 10:28:34 -0600 schrieb olcott:
    On 2/22/2025 3:34 AM, Fred. Zwarts wrote:
    Op 22.feb.2025 om 00:15 schreef olcott:

    Because the code proves that HHH does simulate itself correctly it is
    not stupid for HHH to simulate itself. This was the most difficult
    aspect of creating the x86utm operating system.
    No, the code proves that HHH simulates a different version that doesn't
    abort. See line 1059.
    The code proves that it is correct.
    HHH does correctly recognize and terminate the infinite recursion
    behavior pattern.
    No. Simulating a decider never needs to be aborted.

    --
    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 Sat Feb 22 19:15:34 2025
    Am Sat, 22 Feb 2025 12:57:57 -0600 schrieb olcott:
    On 2/22/2025 12:17 PM, joes wrote:
    Am Sat, 22 Feb 2025 12:07:17 -0600 schrieb olcott:
    On 2/22/2025 10:45 AM, joes wrote:
    Am Sat, 22 Feb 2025 10:28:34 -0600 schrieb olcott:
    On 2/22/2025 3:34 AM, Fred. Zwarts wrote:
    Op 22.feb.2025 om 00:15 schreef olcott:

    Because the code proves that HHH does simulate itself correctly it
    is not stupid for HHH to simulate itself. This was the most
    difficult aspect of creating the x86utm operating system.
    No, the code proves that HHH simulates a different version that
    doesn't abort. See line 1059.
    The code proves that it is correct.
    HHH does correctly recognize and terminate the infinite recursion
    behavior pattern.
    No. Simulating a decider never needs to be aborted.
    You can equally assume that squares are round.
    Lol. Deciders *always* terminate.

    you never did tell me whether or not you fully understand what infinite recursion is.
    You wouldn't believe 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)
  • From Richard Damon@21:1/5 to olcott on Sat Feb 22 19:02:38 2025
    On 2/22/25 11:28 AM, olcott wrote:
    On 2/22/2025 3:34 AM, Fred. Zwarts wrote:
    Op 22.feb.2025 om 00:15 schreef olcott:
    On 2/20/2025 3:35 AM, Fred. Zwarts wrote:
    Op 20.feb.2025 om 01:34 schreef olcott:
    On 2/19/2025 4:55 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 17:48 schreef olcott:
    On 2/18/2025 8:11 AM, Fred. Zwarts wrote:
    Op 18.feb.2025 om 14:37 schreef olcott:
    On 2/18/2025 6:25 AM, Richard Damon wrote:
    On 2/18/25 6:26 AM, olcott wrote:
    On 2/18/2025 3:24 AM, Mikko wrote:
    On 2025-02-17 09:05:42 +0000, Fred. Zwarts said:

    Op 16.feb.2025 om 23:51 schreef olcott:
    On 2/16/2025 4:30 PM, joes wrote:
    Am Sun, 16 Feb 2025 15:58:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>> On 2/16/2025 2:02 PM, joes wrote:
    Am Sun, 16 Feb 2025 13:24:14 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>> On 2/16/2025 10:35 AM, joes wrote:
    Am Sun, 16 Feb 2025 06:51:12 -0600 schrieb olcott: >>>>>>>>>>>>>>>>>>>> On 2/15/2025 2:49 AM, Mikko wrote:
    On 2025-02-14 12:40:04 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>> On 2/14/2025 2:58 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>> On 2025-02-14 00:07:23 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>> On 2/13/2025 3:20 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-13 04:21:34 +0000, olcott said: >>>>>>>>>>>>>>>>>>>>>>>>>> On 2/12/2025 4:04 AM, Mikko wrote: >>>>>>>>>>>>>>>>>>>>>>>>>>> On 2025-02-11 14:41:38 +0000, olcott said: >>>>>>>>>>>>>>>
    DD  correctly simulated by HHH cannot possibly >>>>>>>>>>>>>>>>>>>>>> terminate normally.

    That claim has already shown to be false. Nothing >>>>>>>>>>>>>>>>>>>>> above shows that
    HHH does not return 0. If it does DD also returns 0. >>>>>>>>>>>>>>>>>>>> When we are referring to the above DD simulated by >>>>>>>>>>>>>>>>>>>> HHH and not
    trying to get away with changing the subject to some >>>>>>>>>>>>>>>>>>>> other DD
    somewhere else
    such as one that calls a non-aborting version of HHH >>>>>>>>>>>>>>>>>>>
    then anyone with sufficient knowledge of C >>>>>>>>>>>>>>>>>>>> programming knows that no
    instance of DD shown above simulated by any >>>>>>>>>>>>>>>>>>>> corresponding instance
    of HHH can possibly terminate normally. >>>>>>>>>>>>>>>>>>> Well, then that corresponding (by what?) HHH isn’t a >>>>>>>>>>>>>>>>>>> decider.
    I am focusing on the isomorphic notion of a >>>>>>>>>>>>>>>>>> termination analyzer.
    (There are other deciders that are not termination >>>>>>>>>>>>>>>>> analysers.)

    A simulating termination analyzer correctly rejects >>>>>>>>>>>>>>>>>> any input that
    must be aborted to prevent its own non-termination. >>>>>>>>>>>>>>>>> Yes, in particular itself is not such an input, because >>>>>>>>>>>>>>>>> we *know* that
    it halts, because it is a decider. You can’t have your >>>>>>>>>>>>>>>>> cake and eat it
    too.
    I am not even using the confusing term "halts". >>>>>>>>>>>>>>>> Instead I am using in its place "terminates normally". >>>>>>>>>>>>>>>> DD correctly simulated by HHH cannot possibly terminate >>>>>>>>>>>>>>>> normally.
    What’s confusing about „halts”? I find it clearer as it >>>>>>>>>>>>>>> does not imply
    an ambiguous „abnormal termination”. How does HHH >>>>>>>>>>>>>>> simulate DD
    terminating abnormally, then? Why doesn’t it terminate >>>>>>>>>>>>>>> abnormally
    itself?
    You can substitute the term: the input DD to HHH does not >>>>>>>>>>>>>>> need to be
    aborted, because the simulated decider terminates. >>>>>>>>>>>>>>>

    typedef void (*ptr)();
    int HHH(ptr P);

    int DD()
    {
      int Halt_Status = HHH(DD);
      if (Halt_Status)
        HERE: goto HERE;
      return Halt_Status;
    }

    int main()
    {
      HHH(DD);
    }

    Every simulated input that must be aborted to
    prevent the non-termination of HHH is stipulated
    to be correctly rejected by HHH as non-terminating. >>>>>>>>>>>>>>
    A very strange and invalid stipulation.

    It merely means that the words do not have their ordinary >>>>>>>>>>>> meaning.


    Unless HHH(DD) aborts its simulation of DD itself cannot >>>>>>>>>>> possibly terminate normally. Every expert in the C
    programming language
    can see this. People that are not experts get confused by the >>>>>>>>>>> loop
    after the "if" statement.


    So? Since it does that, it needs to presume that the copy of >>>>>>>>>> itself it sees called does that.


    Not at all. Perhaps your technical skill is much more woefully >>>>>>>>> deficient than I ever imagined.

    Here is the point that you just missed Unless the first HHH
    that sees the non-terminating pattern aborts its simulation
    none of them do because they all have the exact same code.



    The point Olcott misses is that if the non-terminating HHH is
    changed to abort the simulation, the program is changed. He does >>>>>>>> not understand that a modification of a program makes a change. >>>>>>>> Such a change modifies the behaviour of the program. The non-
    termination behaviour has disappeared with this change and only >>>>>>>> remains in his dreams. After this change, the simulation would >>>>>>>> terminate normally and HHH should no longer abort. But it does, >>>>>>>> because the code that detects the 'special condition' has a bug, >>>>>>>> which makes that it does not see that the program has been
    changed into a halting program.


    When I focus on one single-point:
    I get two years of dodging and this point is never addressed.

    [DD simulated by HHH cannot possibly terminate normally]

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

    int main()
    {
       HHH(Infinite_Recursion);
       HHH(DDD);
    }

    It is not true that this point has never been addressed. Olcott
    ignores it when it is addressed.

    What is the point? Even if HHH fails to simulate the halting
    program DD up to the end because it is logically impossible for it >>>>>> to complete the simulation, it still fails.

    It fails In the same way that every CAD system
    will never correctly represent a geometric circle that has
    four equal length sides in the same two dimensional plane.



    Indeed. Such a CAD system fails if it is given the task to draw a
    square circle. Similarly, HHH fails if it is given the task to
    determine the termination behaviour of DD.

    It DOES NOT FAIL when it is defined coherently.
    The square root of a basket of rotten eggs is also not computable.

    Therefore it is stupid to give something the task to compute the
    square root of a basket of rotten eggs. Similarly, it is equally
    stupid to try the impossible task of letting HHH simulate itself.

    Because the code proves that HHH does simulate itself correctly
    it is not stupid for HHH to simulate itself. This was the most
    difficult aspect of creating the x86utm operating system.


    No it doesn't, as it aborts its simulation. Aborted simulations are not "correct"

    It is of course stupid for HHH to claim a simulation is correct, when
    the behavior of running that program differs from what HHH says,

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