Re: HHH(DD) does correctly reject its input as non-halting --- VERIFIED FACT

On 6/13/25 10:37 AM, olcott wrote:

On 6/13/2025 4:26 AM, Fred. Zwarts wrote:

Op 12.jun.2025 om 17:30 schreef olcott:
>
Even after many corrections, Olcott repeated his claims without learning anything from his previous errors.
Lack of knowledge does not make someone look stupid, but the resistance against learning does.
>

int DD()
{
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
>
It is a verified fact that DD() *is* one of the forms
of the counter-example input as such an input would
be encoded in C. Christopher Strachey wrote his in CPL.
>
// rec routine P
//   §L :if T[P] go to L
//     Return §
// https://academic.oup.com/comjnl/article/7/4/313/354243
void Strachey_P()
{
   L: if (HHH(Strachey_P)) goto L;
   return;
}
>
https://academic.oup.com/comjnl/article-abstract/7/4/313/354243? redirectedFrom=fulltext
>
It *is* a verified fact DD correctly simulated by HHH
cannot possibly reach its own "return" statement
final halt state.

>
Showing the failure of HHH to reach the end of the simulation.

 The code of the input to HHH(DD) specifies
HHH simulates DD that calls HHH(DD)
HHH simulates DD that calls HHH(DD)
HHH simulates DD that calls HHH(DD)...

Then you are lying that HHH will abort and return 0.
That is your problem, you world is based on being able to just lie about what you want.

 That you can't understand this is merely a lack
of sufficient tecnh9cal competence on your part.
 

No, it is merely a lack of honesty on your part.

That you continue to fail to show all of the details
of exactly how DD does reach its simulated "return"
statement final halt state proves that you know you
are not competent.
 

But DD DOES reach its final state when HHH(DD) returns 0, which you have also stiplated, showing that you world is based on self-contradictions.
You somehow thing that HHH can do both simulate its input forever and also abort after finite time and return an answer.
Thus you think there is some finite number N that is bigger than an unboudned number.
Sorry, you are just proving you don't know what you are talking about.

 

 A simulation that is no problem for other world-class simulators.
What is the purpose to verify the fact of a failure? Another confirmation of the halting theorem?
>

>
All of the above code is fully operational in this file
https://github.com/plolcott/x86utm/blob/master/Halt7.c
>

>
Halt.c includes code to abort and halt the simulation.
HHH is not able to simulate this code correctly, because the criteria to abort are incorrect. It aborts the simulation even for some halting programs, including the simulation of itself.