Re: Simulating Termination Analyzer HHH correctly rejects input DDD

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