Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)

On 5/10/25 9:26 PM, olcott wrote:

On 5/10/2025 8:17 PM, wij wrote:

On Sat, 2025-05-10 at 17:03 -0500, olcott wrote:

On 5/10/2025 4:44 PM, wij wrote:

On Sat, 2025-05-10 at 14:29 -0500, olcott wrote:

On 5/10/2025 2:02 PM, wij wrote:

 

>
You don't know the counter example in the HP proof, your D is not the case what HP says.
>

 Sure I do this is it! (as correctly encoded in C)
 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);
}
 

Nope.
The D in the HP proof includes a copy of the halt decider H as part of its code.
It is a full program, not a non-leaf function as your D is.
You are just comitting a major category error, and then trying to expliot it to make your proof.
When you fix that error, by realizing that all the code for HHH is part of the program DDD, then each HHH in your set each get DIFFERENT inputs, of this DD funciton paired with those different HHHs, and thus you can't use the behavor of one to make claims of the behavior of a different one.
Sorry, you have been told of this many times, and your refusal to listen has just made your error a reckless disregard for the truth, and thus is a deliberate lie. It seems you are proving that either you just have no care about what is the truth and thus are a pathological liar, or are just too stupid to be able to learn the material, which is just another form of pathology that comes out as the lying.