Liste des Groupes | Revenir à theory |
On 6/23/2025 6:45 PM, Richard Damon wrote:Right, but N < ∞ is not ALL, and thus not a "Correct Simulation" but only a PARTIAL simulation, and every one of those HHH's create a DIFFERENT DDD, where there is a N < M such that the correct simulation of THAT input will reach a final state, and thus shows that it is a halting input.On 6/23/25 1:34 PM, olcott wrote:You aren't bothering to think that through at all. Every HHHOn 6/23/2025 10:34 AM, joes wrote:>Am Mon, 23 Jun 2025 09:30:07 -0500 schrieb olcott:>On 6/23/2025 6:02 AM, Richard Damon wrote:>Such as HHH, making it not a decider (when simulated).In particular, the pattern you are trying to claim to use, is part ofIf you read the 38 pages you will see how this is incorrect. ChatGPT
the Halting Program D, DD, and DDD, so it is BY DEFINITION incorrect.
"understands" that any program that must be aborted at some point to
prevent its infinite execution is not a halting program.
>
void DDD()
{
HHH(DDD);
return;
}
>
*dead obvious to any first year computer science student*
My claim is that DDD correctly simulated by any simulating
termination analyzer HHH that can possibly exist cannot possibly
reach its own simulated "return" statement final halt state.
>
>
>
>
Which is irrelevent, as any machine HHH that does that isn't a Halt Decider, because it isn't a decider at all.
>
that correctly simulates N instructions of DDD where N < ∞:
(a) Correctly simulates N instructions of DDD
(b) returns some value to its caller.
Thus, your criteria is just based on the presumption of the impossible, and the equivocation of what you are talking about.
>
Those are just the tools of pathological liars.
Les messages affichés proviennent d'usenet.