Liste des Groupes | Revenir à theory |
Am Tue, 11 Mar 2025 21:03:35 -0500 schrieb olcott:Nor can it. We've known that for a long time because Turing gave the proof in 1936.On 3/11/2025 8:41 PM, Richard Heathfield wrote:On 12/03/2025 01:22, olcott wrote:lol*It was dishonest of you to remove this context*DDD correctly simulated by HHH never reaches its own "return"If it correctly simulates infinitely many steps, it doesn't terminate.
instruction and terminates normally in any finite or infinite number
of correctly simulated steps.
Look up "infinite".
On 3/11/2025 12:42 PM, Mike Terry wrote:
> (Even though it demonstrably DOES halt if not aborted and simulated
> further.
That statement is stupidly false.
It is impossible because a decider doesn't exist.But your task is to decide for /any/ program, not just DDD.No you have this WRONG.
My WHOLE effort has been to correctly determine the halt status of the
conventional halting problem proof's "impossible" input.
Les messages affichés proviennent d'usenet.