One key aspect of the halting problem itself has always been a bogus ruse
From olcott@polcott333@gmail.com to comp.theory,comp.lang.c++,comp.lang.c,comp.ai.philosophy on Wed Sep 24 09:59:06 2025
From Newsgroup: comp.lang.c++
Deciders have always been defined to compute the
mapping from their inputs verifying whether or not
this input specifies a semantic or syntactic property.
The input to a C function is its arguments.
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
DD();
return 0;
}
The actual executing process of DD() above cannot
possibly be an argument to the HHH(DD) that it calls.
HHH gets the machine address of a finite string of x86
machine code that is *not exactly one-and-the-same-thing*
as the executing process of main()-->DD() shown above.
The Halting Problem is itself a mere bogus ruse because
it requires a halt decider to report on something other
than the semantic property of its actual input. That is
just not the way that Turing machine deciders actually work.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer