Liste des Groupes | Revenir à theory |
Op 08.feb.2025 om 00:13 schreef olcott:When DD calls HHH(DD) in recursive simulation it is aExperts in the C programming language will know that DDYes, it demonstrates the incapability of HHH to correctly determine the halting behaviour of DD
correctly simulated by HHH cannot possibly reach its own
"if" statement.
>The finite string defines one behaviour. This finite string, when given to an X86 processor shows halting behaviour. This finite string,when given to a world class simulator, shows halting behaviour. Only HHH fails to see this proven halting behaviour. So it proves the failure of HHH.
The finite string DD specifies non-terminating recursive
simulation to simulating termination analyzer HHH. This
makes HHH necessarily correct to reject its input as
non-halting.
HHH aborts the simulation on unsound grounds one cycle before the simulation would terminate normally.
>Yes. And the behaviour of this finite string has been proven to show halting behaviour. Only Olcott's HHH fails to see it.
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);
}
>
https://www.researchgate.net/ publication/369971402_Simulating_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D
>
https://github.com/plolcott/x86utm/blob/master/Halt7.c
has fully operational HHH and DD
>
The halting problem has always been a mathematical mapping
from finite strings to behaviors.
His misunderstanding is that he thinks that the behaviour defined by the finite string depends on the simulator.
He fail to see that a finite string defines a behaviour independent of the thing that runs or simulates it. It seems that he is incapable to learn that a failure of a simulator does not define a behaviour.--
Les messages affichés proviennent d'usenet.