Liste des Groupes | Revenir à theory |
Experts in the C programming language will know that DDWrong, they understand that nothing below exludes the possibility that
correctly simulated by HHH cannot possibly reach its own
"if" statement.
The finite string DD specifies non-terminating recursiveNo, it does not. DD as quoted below pecifies nothing about the behaviour
simulation to simulating termination analyzer HHH.
This makes HHH necessarily correct to reject its input asNo, it does not. It is not correct to reject the input to HHH as non-halting
non-halting.
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://github.com/plolcott/x86utm/blob/master/Halt7.cNo, it has not. There is no DD there.
has fully operational HHH and DD
The halting problem has always been a mathematical mappingThe problem is not a mappling. It requires that its solution is.
from finite strings to behaviors.
Les messages affichés proviennent d'usenet.