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

On 4/2/25 8:48 PM, olcott wrote:

On 4/2/2025 4:18 PM, dbush wrote:

On 4/2/2025 11:55 AM, olcott wrote:

On 4/2/2025 9:14 AM, joes wrote:

Am Mon, 31 Mar 2025 16:26:58 -0500 schrieb olcott:

On 3/31/2025 2:10 PM, Fred. Zwarts wrote:

Op 31.mrt.2025 om 20:16 schreef olcott:

>

A simulating termination analyzer is always correct to abort the
simulation and reject the input as non-halting when-so-ever this input
would otherwise prevent itself from halting.
>

But the input is halting, as proven by direct execution.

>
Something other than the input is halting.
HHH1(DDD) shows the same behavior as the direct execution.
   HHH(DDD) shows the behavior of the actual input.

Why are you not passing DDD as input? Why do you not call what you're
doing HHH(HHH(DDD))? What is the difference in what is passed to HHH1?
>

>
This seems to be above your level of technical competence.
>
_DDD()
[00002172] 55         push ebp      ; housekeeping
[00002173] 8bec       mov  ebp,esp  ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404     add  esp,+04
[00002182] 5d         pop  ebp
[00002183] c3         ret
Size in bytes:(0018) [00002183]
>
Anyone understanding the above code where HHH
emulates DDD according to the semantics of the
x86 language knows that this DDD (not some
other different DDD) cannot possibly reach its
own final halt state.

>
Category error.  The algorithm DDD and the algorithm HHH are fixed and immutable, so to say that "this DDD cannot possibly reach its own final state" implies that HHH varies but it does not.
>
The only valid statements would be that either HHH *does* emulate DDD to a final state, or HHH *does not* emulate DDD to a final state.
>
So which is it?

 DDD emulated by HHH specifies recursive emulation.

Finitely recursive emulation.

DDD emulated by HHH1 DOES NOT specify recursive emulation.

No, HHH1 still sees DDD call HHH to finitely recursively emulate DDD.

  *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 the input doesn't prevent its own termination, at least not the one based on the HHH that returns 0, as that calls its own HHH that will also return that 0.
Since that is the input given to the HHH that returns 0, it can't correctly use that argument, as its input WILL halt when completely emulated, it is just that this HHH doesn't do it, so it just wrong.
Your problem is you are too stupid to know what you are talking about.