Re: DD specifies non-terminating behavior to HHH --- COMPLETE PROOF

On 2/25/25 1:01 PM, olcott wrote:

On 2/25/2025 10:13 AM, Mikko wrote:

Althogh the subject line has the words "COMPLETE PROOF" there is no
proof or pointer to proof below.
>

  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);
}
 The above does specify that DD simulated by HHH
cannot possibly terminate normally by reaching its
own "return" instruction.
 That this may be beyond your technical skill level.
is less than no rebuttal at all.
 Ignoring the code in main() seemed dishonest.
 

Since it isn't part of the problem, why is that?
Thje question is about DD as a Turing Machine (eqquivalent), if the main scafolding is needed for your equivalence system, it isn't really part of the original problem.
When converting the requirments from Turing Machines to your C Language version, the question being ask of the decider, is would the full program defined by the input (and it needs to be a full program) return to main when main directly calls it or not?
The fact that you need to alter-is (and thus LIE) about the problem to be about HHH emulating the input, when the problem NEVER stated emulation, and especially not by a partial (and thus incorrrect) emulation, so you are just showing that you are just a liar.