Re: DDD specifies recursive emulation to HHH and halting to HHH1 --- STA

On 4/1/25 10:37 PM, olcott wrote:

On 4/1/2025 8:13 PM, Richard Damon wrote:

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.
>

 You already admitted that you are lying about this.
DDD emulated by HHH for an infinite number of steps
never reaches its final halt state.

But that isn't something that happens with THIS HHH, since it doesn't do that.

 HHH sees this in one recursive emulation of DDD.

And if it acts on it, it is the HHH that does that.

 *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. The only rebuttal to this is rejecting the notion that deciders must always halt.
 

But DDD doesn't prevent its own termination, at least not the one that calls the actual decider HHH. You keep on confusing different version of the program DDD (likely because you don't understand what makes a program).
Your problem is that in your insanity you confuse different version of your setup as being the same, when you point out there differences.
All you are doing is proving that you are just utter ignorant of the basic facts of the system you are talking about, and don't care how many lies you telll.