Liste des Groupes | Revenir à c theory |
Experts 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 DD specifies non-terminating recursiveThe 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.
simulation to simulating termination analyzer HHH. This
makes HHH necessarily correct to reject its input as
non-halting.
typedef void (*ptr)();Yes. And the behaviour of this finite string has been proven to show halting behaviour. Only Olcott's HHH fails to see it.
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.
Les messages affichés proviennent d'usenet.