• Re: Simulating Termination Analyzer HHH correctly rejects input DDD

    From Richard Damon@21:1/5 to olcott on Wed Oct 9 07:46:39 2024
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with
    someone they [claim to] consider a "stupid liar".  So which are you?
    Not sane?  Or stupid enough to try to score points off someone who is
    incapable of conceding them?  Or lying when you describe Peter?  You
    must surely have better things to do.  Meanwhile, you surely noticed
    that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one sensible >>> is reading the repetitive stuff.  Decades, and myriads of articles, ago >>> people here tried to help you knock your points into shape, but anything >>> sensible is swamped by the insults.  Free advice, worth roughly what you >>> are paying for it:  step back, and summarise [from scratch, not using
    HHH
    and DDD (etc) without explanation] (a) what it is you think you are
    trying
    to prove and (b) what progress you claim to have made.  No more than one >>> side of paper.  Assume that people who don't actively insult you are, in >>> fact, trying to help.

    And this approach has been tried many times. It makes no more progress
    than the ones you are criticizing. Just assume the regulars are
    lonesome, very lonesome and USENET keeps everybody off the deserted
    streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern


    HHH recognizes this pattern when HHH emulates itself emulating DDD

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


    Which isn't a correct analysis (but of course, that is just what you do)

    Since we know that HHH(DDD) returns 0, it can not be a non-terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an HHH(DDD)
    that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that never
    returns an answer.

    Your logic is just looking at your LIE based on the fact that the
    PARTIAL EMULATION BY HHH doesn't reach the end, and in your stupidity
    you confuse the lack of knowledge in HHH of the terminatation to a
    factual concept that HHH doesn't.

    I guess this meams that you support the claims of Donald Trump that he
    "won the election" and of the climate change deniers, as they use the
    same basic logic as you do.

    Sorry, but that IS the camp you have placed your self into.


    thus each of the directly executed  HHH emulators that does
    return 0 correctly reports the above non-terminating behavior.

    Nope, just that you are a liar.


    https://github.com/plolcott/x86utm x86utm operating system

    Every executed HHH that returns 0 correctly reports that
    DDD emulated by its corresponding HHH never returns.



    Nope. Proves that DDD() will halt when HHH(DDD) returns 0 and thus that
    HHH is incorrect.

    You are just showing that

    PPPP EEEEE TTTTT EEEEE RRRR
    P P E T E R R
    P P E T E R R
    PPPP EEEEE T EEEEE RRRR
    P E T E R R
    P E T E R R
    P EEEEE T EEEEE R R


    OOO L CCC OOO TTTTT TTTTT
    O O L C C O O T T
    O O L C O O T T
    O O L C O O T T
    O O L C O O T T
    O O L C C O O T T
    OOO LLLLL CCC OOO T T


    L IIIII EEEEE SSS
    L I E S S
    L I E S
    L I EEEEE SSS
    L I E S
    L I E S S
    LLLLL IIIII EEEEE SSS


    AND THINKS IT IS OK

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Oct 9 19:48:29 2024
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with >>>>> someone they [claim to] consider a "stupid liar".  So which are you? >>>>> Not sane?  Or stupid enough to try to score points off someone who is >>>>> incapable of conceding them?  Or lying when you describe Peter?  You >>>>> must surely have better things to do.  Meanwhile, you surely noticed >>>>> that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one sensible >>>>> is reading the repetitive stuff.  Decades, and myriads of articles, >>>>> ago
    people here tried to help you knock your points into shape, but
    anything
    sensible is swamped by the insults.  Free advice, worth roughly
    what you
    are paying for it:  step back, and summarise [from scratch, not
    using HHH
    and DDD (etc) without explanation] (a) what it is you think you are
    trying
    to prove and (b) what progress you claim to have made.  No more
    than one
    side of paper.  Assume that people who don't actively insult you
    are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more
    progress than the ones you are criticizing. Just assume the regulars
    are lonesome, very lonesome and USENET keeps everybody off the
    deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern


    HHH recognizes this pattern when HHH emulates itself emulating DDD

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


    Which isn't a correct analysis (but of course, that is just what you do)

    Since we know that HHH(DDD) returns 0, it can not be a non-terminating
    behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to
    return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an
    HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that never
    returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly executed.
    or youy are lying about working on the Halting Problem.

    Sorry, that if fact, which you do not actually try to refute, just deny.


    thus each of the directly executed HHH emulators that does
    return 0 correctly reports the above non-terminating behavior.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Wed Oct 9 22:20:18 2024
    On 10/9/24 8:15 PM, olcott wrote:
    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with >>>>>>> someone they [claim to] consider a "stupid liar".  So which are you? >>>>>>> Not sane?  Or stupid enough to try to score points off someone
    who is
    incapable of conceding them?  Or lying when you describe Peter?  You >>>>>>> must surely have better things to do.  Meanwhile, you surely noticed >>>>>>> that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one sensible
    is reading the repetitive stuff.  Decades, and myriads of
    articles, ago
    people here tried to help you knock your points into shape, but
    anything
    sensible is swamped by the insults.  Free advice, worth roughly >>>>>>> what you
    are paying for it:  step back, and summarise [from scratch, not >>>>>>> using HHH
    and DDD (etc) without explanation] (a) what it is you think you
    are trying
    to prove and (b) what progress you claim to have made.  No more >>>>>>> than one
    side of paper.  Assume that people who don't actively insult you >>>>>>> are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more
    progress than the ones you are criticizing. Just assume the
    regulars are lonesome, very lonesome and USENET keeps everybody
    off the deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern


    HHH recognizes this pattern when HHH emulates itself emulating DDD

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


    Which isn't a correct analysis (but of course, that is just what you
    do)

    Since we know that HHH(DDD) returns 0, it can not be a non-
    terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to
    return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an
    HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that never
    returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly executed.

    THAT IS NOT WHAT I SAID !!!


    So, you are admitting you don't know what your words mean? Since that
    *IS* what they mean. Your failure to even attempt to refute my grammer
    analysis shows you accept my logic, or at least can't fight it.

    So, What exactly did you mean your words to say?

    Remember, if it isn't about the behavior of the actual program DDD, then
    you are just admitting that you are lying it indicating non-termination
    of the program represented by the input, and thus lying about what you
    are doing.

    The fact that a partial emulation doesn't reach the end is not even good evidence, let allone proof, of non-terminating behavior.

    And, since each DDD that uses a different version of HHH is a different
    input, the others don't matter unless you admit that you aren't talking
    about programs, and thus not talking about Computation Theory.

    You are just backing yourself into the corner with your lies and deciet.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Thu Oct 10 11:17:45 2024
    On 2024-10-10 00:15:09 +0000, olcott said:

    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with >>>>>>> someone they [claim to] consider a "stupid liar".  So which are you? >>>>>>> Not sane?  Or stupid enough to try to score points off someone who is >>>>>>> incapable of conceding them?  Or lying when you describe Peter?  You >>>>>>> must surely have better things to do.  Meanwhile, you surely noticed >>>>>>> that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one sensible
    is reading the repetitive stuff.  Decades, and myriads of articles, ago
    people here tried to help you knock your points into shape, but anything
    sensible is swamped by the insults.  Free advice, worth roughly what you
    are paying for it:  step back, and summarise [from scratch, not using HHH
    and DDD (etc) without explanation] (a) what it is you think you are trying
    to prove and (b) what progress you claim to have made.  No more than one
    side of paper.  Assume that people who don't actively insult you are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more progress >>>>>> than the ones you are criticizing. Just assume the regulars are
    lonesome, very lonesome and USENET keeps everybody off the deserted >>>>>> streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern


    HHH recognizes this pattern when HHH emulates itself emulating DDD

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


    Which isn't a correct analysis (but of course, that is just what you do) >>>>
    Since we know that HHH(DDD) returns 0, it can not be a non- terminating >>>> behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an HHH(DDD) >>>> that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that never
    returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly executed.

    THAT IS NOT WHAT I SAID !!!

    Why did you not say that truth?

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Thu Oct 10 07:17:17 2024
    On 10/9/24 11:17 PM, olcott wrote:
    On 10/9/2024 9:20 PM, Richard Damon wrote:
    On 10/9/24 8:15 PM, olcott wrote:
    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with
    someone they [claim to] consider a "stupid liar".  So which are >>>>>>>>> you?
    Not sane?  Or stupid enough to try to score points off someone >>>>>>>>> who is
    incapable of conceding them?  Or lying when you describe Peter? >>>>>>>>> You
    must surely have better things to do.  Meanwhile, you surely >>>>>>>>> noticed
    that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one >>>>>>>>> sensible
    is reading the repetitive stuff.  Decades, and myriads of
    articles, ago
    people here tried to help you knock your points into shape, but >>>>>>>>> anything
    sensible is swamped by the insults.  Free advice, worth roughly >>>>>>>>> what you
    are paying for it:  step back, and summarise [from scratch, not >>>>>>>>> using HHH
    and DDD (etc) without explanation] (a) what it is you think you >>>>>>>>> are trying
    to prove and (b) what progress you claim to have made.  No more >>>>>>>>> than one
    side of paper.  Assume that people who don't actively insult >>>>>>>>> you are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more
    progress than the ones you are criticizing. Just assume the
    regulars are lonesome, very lonesome and USENET keeps everybody >>>>>>>> off the deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern >>>>>>

    HHH recognizes this pattern when HHH emulates itself emulating DDD >>>>>>>
    void DDD()
    {
       HHH(DDD);
       return;
    }


    Which isn't a correct analysis (but of course, that is just what
    you do)

    Since we know that HHH(DDD) returns 0, it can not be a non-
    terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to
    return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an
    HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that
    never returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly executed.

    THAT IS NOT WHAT I SAID !!!


    So, you are admitting you don't know what your words mean? Since that
    *IS* what they mean. Your failure to even attempt to refute my grammer
    analysis shows you accept my logic, or at least can't fight it.

    You are not talking about the behavior of DDD emulated by HHH.


    But that was what your previous sentence was talking about, at least if
    it is to be understood in the context of Computation Theory and the
    Halting Problem.

    IF you want your sentence to be talking about the emulation that HHH
    does, then you have to admit that this emulation, because it was not
    complete, doesn't talk about the termination property of DDD, but is a
    property of the decider HHH. Of course, that then makes the second part
    of your statement a lie.

    Your problem is you just don't understand what you are talking about, or
    are just refusing to accept the meaning of them as defined by the field
    you want to talk about.

    You seem to think you are allowed to just redefine fundamental terms,
    which just shows that you don't understand how formal logic works.

    Sorry, you are just proving that you are nothing but an ignorant
    idiotdic pathological liarl

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Thu Oct 10 21:39:05 2024
    On 10/10/24 8:53 AM, olcott wrote:
    On 10/10/2024 6:17 AM, Richard Damon wrote:
    On 10/9/24 11:17 PM, olcott wrote:
    On 10/9/2024 9:20 PM, Richard Damon wrote:
    On 10/9/24 8:15 PM, olcott wrote:
    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion >>>>>>>>>>> with
    someone they [claim to] consider a "stupid liar".  So which >>>>>>>>>>> are you?
    Not sane?  Or stupid enough to try to score points off
    someone who is
    incapable of conceding them?  Or lying when you describe >>>>>>>>>>> Peter? You
    must surely have better things to do.  Meanwhile, you surely >>>>>>>>>>> noticed
    that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one >>>>>>>>>>> sensible
    is reading the repetitive stuff.  Decades, and myriads of >>>>>>>>>>> articles, ago
    people here tried to help you knock your points into shape, >>>>>>>>>>> but anything
    sensible is swamped by the insults.  Free advice, worth >>>>>>>>>>> roughly what you
    are paying for it:  step back, and summarise [from scratch, >>>>>>>>>>> not using HHH
    and DDD (etc) without explanation] (a) what it is you think >>>>>>>>>>> you are trying
    to prove and (b) what progress you claim to have made.  No >>>>>>>>>>> more than one
    side of paper.  Assume that people who don't actively insult >>>>>>>>>>> you are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more >>>>>>>>>> progress than the ones you are criticizing. Just assume the >>>>>>>>>> regulars are lonesome, very lonesome and USENET keeps
    everybody off the deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine >>>>>>>>> address of DDD as input then emulates the x86 machine language >>>>>>>>> of DDD until a non-terminating behavior pattern is recognized. >>>>>>>>
    But fails, because you provided it with a proven incorrect pattern >>>>>>>>

    HHH recognizes this pattern when HHH emulates itself emulating DDD >>>>>>>>>
    void DDD()
    {
       HHH(DDD);
       return;
    }


    Which isn't a correct analysis (but of course, that is just what >>>>>>>> you do)

    Since we know that HHH(DDD) returns 0, it can not be a non-
    terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the >>>>>>>>> finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined >>>>>>>> to return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an >>>>>>>> HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that
    never returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly
    executed.

    THAT IS NOT WHAT I SAID !!!


    So, you are admitting you don't know what your words mean? Since
    that *IS* what they mean. Your failure to even attempt to refute my
    grammer analysis shows you accept my logic, or at least can't fight it. >>>
    You are not talking about the behavior of DDD emulated by HHH.


    But that was what your previous sentence was talking about,

    counter-factual.


    So, you admit that you are not talking in the domain of the halting problem.

    Just saying something is counter-factual doesn't make it so.

    Your problem seems to be that you don't understand what it means to
    proves something, likely because you have chosen to refuse to learn the
    basics of what you are talking about, which just proves your stupidity.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mikko@21:1/5 to olcott on Fri Oct 11 12:47:55 2024
    On 2024-10-11 01:55:37 +0000, olcott said:

    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with >>>>>>> someone they [claim to] consider a "stupid liar".  So which are you? >>>>>>> Not sane?  Or stupid enough to try to score points off someone who is >>>>>>> incapable of conceding them?  Or lying when you describe Peter?  You >>>>>>> must surely have better things to do.  Meanwhile, you surely noticed >>>>>>> that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one sensible
    is reading the repetitive stuff.  Decades, and myriads of articles, ago
    people here tried to help you knock your points into shape, but anything
    sensible is swamped by the insults.  Free advice, worth roughly what you
    are paying for it:  step back, and summarise [from scratch, not using HHH
    and DDD (etc) without explanation] (a) what it is you think you are trying
    to prove and (b) what progress you claim to have made.  No more than one
    side of paper.  Assume that people who don't actively insult you are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more progress >>>>>> than the ones you are criticizing. Just assume the regulars are
    lonesome, very lonesome and USENET keeps everybody off the deserted >>>>>> streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern


    HHH recognizes this pattern when HHH emulates itself emulating DDD

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


    Which isn't a correct analysis (but of course, that is just what you do) >>>>
    Since we know that HHH(DDD) returns 0, it can not be a non- terminating >>>> behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an HHH(DDD) >>>> that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that never
    returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly executed.
    or youy are lying about working on the Halting Problem.


    It seems to me that you just said that:
    the behavior of DDD emulated by HHH
    <is not>
    the behavior of DDD emulated by HHH.

    At least one could say so because the exptession "the behaviour of DDD
    emulated by HHH" can be interpreted in two ways. By the usual rules
    "emulated by HHH" is an attribute of DDD with the intent to prevent
    cofusion with some other function that happens to have the same name.
    But it could also be an attribute of "the behaviour" with the intent
    to prevent confision with the true behaviour of DDD if the behaviour
    emulated by HHH is different from the behaviour specified by the input
    to HHH.

    --
    Mikko

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Oct 11 07:04:05 2024
    On 10/10/24 9:55 PM, olcott wrote:
    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with >>>>>>> someone they [claim to] consider a "stupid liar".  So which are you? >>>>>>> Not sane?  Or stupid enough to try to score points off someone
    who is
    incapable of conceding them?  Or lying when you describe Peter?  You >>>>>>> must surely have better things to do.  Meanwhile, you surely noticed >>>>>>> that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one sensible
    is reading the repetitive stuff.  Decades, and myriads of
    articles, ago
    people here tried to help you knock your points into shape, but
    anything
    sensible is swamped by the insults.  Free advice, worth roughly >>>>>>> what you
    are paying for it:  step back, and summarise [from scratch, not >>>>>>> using HHH
    and DDD (etc) without explanation] (a) what it is you think you
    are trying
    to prove and (b) what progress you claim to have made.  No more >>>>>>> than one
    side of paper.  Assume that people who don't actively insult you >>>>>>> are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more
    progress than the ones you are criticizing. Just assume the
    regulars are lonesome, very lonesome and USENET keeps everybody
    off the deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern


    HHH recognizes this pattern when HHH emulates itself emulating DDD

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


    Which isn't a correct analysis (but of course, that is just what you
    do)

    Since we know that HHH(DDD) returns 0, it can not be a non-
    terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to
    return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an
    HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that never
    returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly executed.
    or youy are lying about working on the Halting Problem.


    It seems to me that you just said that:
    the behavior of DDD emulated by HHH
    <is not>
    the behavior of DDD emulated by HHH.


    No, (the behavior of ddd) [that was] emulated by HHH is a different
    sentence then

    the behavior (of DDD) [by] emulation by HHH

    Instead you seemed to have said that:
    the behavior of DDD emulated by HHH
    is the behavior of DDD when directly executed.

    (The behavior of DDD) is the behavior of DDD directly executed.

    The emulated by HHH, just specifies WHICH DDD was look at.

    The sentence, in the context of Computation Theory and the Halting
    Problem, does not allow the "emulation" to modify behavior (which wasn't
    in your original sentence to begin with) as which behavior is defined by
    the technical definiitions of the field, something you have CHOSEN to no
    learn, thus leading you into self-inflicted stupidity.


    Is this what you mean?


    You are just proving you are trying to use an equivocation.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Oct 11 09:05:14 2024
    On 10/11/24 8:16 AM, olcott wrote:
    On 10/11/2024 6:04 AM, Richard Damon wrote:
    On 10/10/24 9:55 PM, olcott wrote:
    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with
    someone they [claim to] consider a "stupid liar".  So which are >>>>>>>>> you?
    Not sane?  Or stupid enough to try to score points off someone >>>>>>>>> who is
    incapable of conceding them?  Or lying when you describe Peter? >>>>>>>>> You
    must surely have better things to do.  Meanwhile, you surely >>>>>>>>> noticed
    that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one >>>>>>>>> sensible
    is reading the repetitive stuff.  Decades, and myriads of
    articles, ago
    people here tried to help you knock your points into shape, but >>>>>>>>> anything
    sensible is swamped by the insults.  Free advice, worth roughly >>>>>>>>> what you
    are paying for it:  step back, and summarise [from scratch, not >>>>>>>>> using HHH
    and DDD (etc) without explanation] (a) what it is you think you >>>>>>>>> are trying
    to prove and (b) what progress you claim to have made.  No more >>>>>>>>> than one
    side of paper.  Assume that people who don't actively insult >>>>>>>>> you are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more
    progress than the ones you are criticizing. Just assume the
    regulars are lonesome, very lonesome and USENET keeps everybody >>>>>>>> off the deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern >>>>>>

    HHH recognizes this pattern when HHH emulates itself emulating DDD >>>>>>>
    void DDD()
    {
       HHH(DDD);
       return;
    }


    Which isn't a correct analysis (but of course, that is just what
    you do)

    Since we know that HHH(DDD) returns 0, it can not be a non-
    terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to
    return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an
    HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that
    never returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly
    executed. or youy are lying about working on the Halting Problem.


    It seems to me that you just said that:
    the behavior of DDD emulated by HHH
    <is not>
    the behavior of DDD emulated by HHH.


    No, (the behavior of ddd) [that was] emulated by HHH is a different
    sentence then

    the behavior (of DDD) [by] emulation by HHH


    That merely seem grammatically incorrect.
    In any case I am only taking about the behavior of DDD
    emulated by HHH.

    If you mean about the behavior seen in the emulation of DDD by HHH, that
    just is an admission that it is *YOU* working on the strawman, as the
    ONLY correct criteria for Halting/Termination is the behavior of the
    actual program, or things proven to be identical to it.

    The fact that DDD when run halts, just shows that is it just a blantant
    (and stupid) lie to claim the HHH was "correct" to say it doesn't


    Instead you seemed to have said that:
    the behavior of DDD emulated by HHH
    is the behavior of DDD when directly executed.

    (The behavior of DDD) is the behavior of DDD directly executed.


    I am only talking about the behavior of DDD emulated by HHH.
    That <is> the premise to my deduction.

    And if by that you mean the behavior of the emulation of DDD by HHH,
    then you are shown to be LYING about the conclusion, since
    "Non-Termination" is a property of the program it talking about.




    When you change the premise to my deduction as the basis of
    your rebuttal that <is> the strawman error.

    Right, and since the DEFINITION of the term you are using in the
    conclusion is based on a DIFFERENT property than your premise, your
    arguement is shown to be just a strawman with incorrect logic.


    A straw man fallacy (sometimes written as strawman) is the
    informal fallacy of refuting an argument different from the
    one actually under discussion, while not recognizing or
    acknowledging the distinction.
    https://en.wikipedia.org/wiki/Straw_man

    Right, so looking at a partial emulation which doesn't reach the end,
    can NOT be a stand in for the behavior of the program DDD, since they
    differ, and thus your use of it is just a strawman, which appears to be
    a DELIBERATE lie.


    The emulated by HHH, just specifies WHICH DDD was look at.

    The sentence, in the context of Computation Theory and the Halting
    Problem, does not allow the "emulation" to modify behavior (which
    wasn't in your original sentence to begin with) as which behavior is
    defined by the technical definiitions of the field, something you have
    CHOSEN to no learn, thus leading you into self-inflicted stupidity.


    No matter what anyone anywhere says
    THIS IS A VERIFIED FACT.

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

    When HHH is an x86 emulation based termination analyzer
    then each DDD emulated by any HHH that it calls never returns.

    The emulation by HHH never reaches the return, but that does NOT man you
    can say that DDD was non-terminating, so you can not claim that HHH was
    correct to say it is.


    You can legitimately say that is not that way that this
    is typically done in the theory of computation.


    Is this what you mean?


    You are just proving you are trying to use an equivocation.

    I am not using equivocation. You are changing the premise
    to my reasoning and then applying the strawman fallacy.

    No, you *ARE* using equivocation, as you are on one hand talking about
    the behavior of a partial emulation of DDD, and on the other making a
    claim about the behavior of the actual program DDD.

    THAT IS EQUIVOCATION

    And just proves that you are nothing but a stupid blatant liar.

    In this case, I think you have lost the pathological excuse, as you are
    trying to make the argument about why you are right, but just ignoring
    the actual definition, likely because you have INTENTIONALLY made
    yourself IGNORANT of them.

    Sorry, you have just put your reputation six feet under, and it is
    likely never going to be able to come back.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to olcott on Fri Oct 11 09:14:44 2024
    On 10/11/24 8:41 AM, olcott wrote:
    On 10/11/2024 4:47 AM, Mikko wrote:
    On 2024-10-11 01:55:37 +0000, olcott said:

    On 10/9/2024 6:48 PM, Richard Damon wrote:
    On 10/9/24 2:46 PM, olcott wrote:
    On 10/9/2024 6:46 AM, Richard Damon wrote:
    On 10/9/24 7:01 AM, olcott wrote:
    On 10/9/2024 1:08 AM, Jeff Barnett wrote:
    On 10/8/2024 6:49 AM, Andy Walker wrote:
    ... after a short break.

         Richard -- no-one sane carries on an extended discussion with
    someone they [claim to] consider a "stupid liar".  So which are >>>>>>>>> you?
    Not sane?  Or stupid enough to try to score points off someone >>>>>>>>> who is
    incapable of conceding them?  Or lying when you describe Peter? >>>>>>>>> You
    must surely have better things to do.  Meanwhile, you surely >>>>>>>>> noticed
    that Peter is running rings around you.

         Peter -- you surely have better things to do.  No-one >>>>>>>>> sensible
    is reading the repetitive stuff.  Decades, and myriads of
    articles, ago
    people here tried to help you knock your points into shape, but >>>>>>>>> anything
    sensible is swamped by the insults.  Free advice, worth roughly >>>>>>>>> what you
    are paying for it:  step back, and summarise [from scratch, not >>>>>>>>> using HHH
    and DDD (etc) without explanation] (a) what it is you think you >>>>>>>>> are trying
    to prove and (b) what progress you claim to have made.  No more >>>>>>>>> than one
    side of paper.  Assume that people who don't actively insult >>>>>>>>> you are, in
    fact, trying to help.

    And this approach has been tried many times. It makes no more
    progress than the ones you are criticizing. Just assume the
    regulars are lonesome, very lonesome and USENET keeps everybody >>>>>>>> off the deserted streets at night.

    HHH is an emulating termination analyzer that takes the machine
    address of DDD as input then emulates the x86 machine language
    of DDD until a non-terminating behavior pattern is recognized.

    But fails, because you provided it with a proven incorrect pattern >>>>>>

    HHH recognizes this pattern when HHH emulates itself emulating DDD >>>>>>>
    void DDD()
    {
       HHH(DDD);
       return;
    }


    Which isn't a correct analysis (but of course, that is just what
    you do)

    Since we know that HHH(DDD) returns 0, it can not be a non-
    terminating behaivor, but that claim is just a lie.

    One cannot simply ignore the actual behavior specified by the
    finite string x86 machine language of DDD such that


    Right, one can not ignore the fact that HHH(DDD) is determined to
    return 0.

    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    More lies. It has been determined that EVERY DDD that calls an
    HHH(DDD) that returns 0 will halt.

    The DDDs that don't return are the ones that call an HHH that
    never returns an answer.


    *Your weasel words are in incorrect paraphrase of this*

    WHAT PARAPHARSE.


    DDD emulated by each corresponding HHH that can possibly
    exist never returns

    No, that means the behavior of the code of DDD when directly
    executed. or youy are lying about working on the Halting Problem.


    It seems to me that you just said that:
    the behavior of DDD emulated by HHH
    <is not>
    the behavior of DDD emulated by HHH.

    At least one could say so because the exptession "the behaviour of DDD
    emulated by HHH" can be interpreted in two ways.

    It can be interpreted an infinite number of ways when the requirement
    that the interpretation be correct is dropped.

    And, the only CORRECT interpretation goes by the DEFINITIONS of the
    words, which means that "non-termination" is a property of a complete
    program (which your "finite-string" for DDD does not express) and that
    said program never reaches a terminal state even after an unbounded
    number of steps, which this HHH's emulation doesn't do.

    So, you are just proving yourself to be a blatant liar.


    The x86 machine code of DDD and HHH provides the single correct
    way to interpret DDD emulated by HHH.


    Right, and that machine code needs to INCLUDE the machine code of HHH,
    since your doesn't, it is IMPOSSIBLE for your HHH to do what you claim,
    as it CAN NOT correctly emulate the call to HHH.

    _DDD()
    [00002172] 55         push ebp      ; housekeeping
    [00002173] 8bec       mov ebp,esp   ; housekeeping
    [00002175] 6872210000 push 00002172 ; push DDD
    [0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
    [0000217f] 83c404     add esp,+04
    [00002182] 5d         pop ebp
    [00002183] c3         ret
    Size in bytes:(0018) [00002183]

    Fully operational code is here. https://github.com/plolcott/x86utm/blob/master/Halt7.c

    Which proves you wrong, as you can show that DDD returns since HHH(DDD)
    return 0


    By the usual rules
    "emulated by HHH" is an attribute of DDD with the intent to prevent
    cofusion with some other function that happens to have the same name.
    But it could also be an attribute of "the behaviour" with the intent
    to prevent confision with the true behaviour of DDD if the behaviour
    emulated by HHH is different from the behaviour specified by the input
    to HHH.




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