Sujet : Re: DDD specifies recursive emulation to HHH and halting to HHH1 --- STA
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 02. Apr 2025, 02:13:07
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <524b81bf3658a42bcba56f807fce28bfea67d36f@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
User-Agent : Mozilla Thunderbird
On 4/1/25 7:35 PM, olcott wrote:
On 4/1/2025 5:36 AM, Richard Damon wrote:
On 3/31/25 10:19 PM, olcott wrote:
>
*Simulating termination analyzer Principle*
It is always correct for any simulating termination
analyzer to stop simulating and reject any input
that would otherwise prevent its own termination.
>
>
But DDD doesn't prevent its own terminatation, as it calls an HHH that WILL abort its emulation and return and answer.
>
You know that DDD stopping running and DDD reaching its
final halt state are not the same thing you damned liar.
Right, the DDD who's simulation is stopped hasn't shown non-halting behavior, just not-yet-halted.
Only the COMPLETE emulation of the input, which will see that it halts, determines whether it halts or not.
Your problem is you think the finite number of steps that HHH emulated is the unbounded number of steps needed for non-halting (because correct emulation doesn't stop in a finite number of steps unless it reaches a final state).
Sorry, you are just proving you are just a pathological liar that doesn't understand what he is talking about.