Liste des Groupes | Revenir à theory |
On 3/11/2025 10:33 PM, olcott wrote:*Because I totally answered this too many times*On 3/11/2025 9:29 PM, Richard Heathfield wrote:Obviously, so what's the next step?On 12/03/2025 02:06, olcott wrote:>On 3/11/2025 9:02 PM, dbush wrote:>On 3/11/2025 9:41 PM, Richard Heathfield wrote:>On 12/03/2025 01:22, olcott wrote:>DDD correctly simulated by HHH never reaches its>
own "return" instruction and terminates normally
in any finite or infinite number of correctly
simulated steps.
If it correctly simulates infinitely many steps, it doesn't terminate. Look up "infinite".
>
But your task is to decide for /any/ program, not just DDD. That, as you are so fond of saying, is 'stipulated', and you can't get out of it. The whole point of the Entscheidungsproblem is its universality. Ignore that, and you have nothing.
>
>
Given that his code has HHH(DD) returning 0,
THESE ARE THE WORDS ANYONE THAT DODGES THESE
WORDS WILL BE TAKEN FOR A LIAR
>
"THESE ARE THE WORDS ANYONE THAT DODGES THESE WORDS WILL BE TAKEN FOR A LIAR"?
>
Is that all you've got? Nothing on your function's inability to correctly decide on whether arbitrary input programs terminate, which is a ***stipulated*** requirement for the problem.
>
Without that, all you have is loud.
>void DDD()>
{
HHH(DDD);
return;
}
>
DDD correctly simulated by HHH never reaches its
own "return" instruction and terminates normally
in any finite or infinite number of correctly
simulated steps.
Look up "infinite". You keep using that word. I do not think it means what you think it means.
>
Replacing the code of HHH with an unconditional simulator and subsequently running HHH(DD) cannot
possibly f-cking halt no f-cking matter what.
>
Les messages affichés proviennent d'usenet.