Re: Defining a correct simulating halt decider

Am Mon, 02 Sep 2024 17:22:50 -0500 schrieb olcott:

On 9/2/2024 12:52 PM, Fred. Zwarts wrote:

Op 02.sep.2024 om 18:38 schreef olcott:

A halt decider never ever computes the mapping for the computation
that itself is contained within.

Then it is unsuited to the halting problem.

Indeed, it should simulate *itself* and not a hypothetical other HHH
with different behaviour.
If HHH includes code to see a 'special condition' and aborts and halts,
then it should also simulate the HHH that includes this same code and

 
DDD has itself and the emulated HHH stuck in recursive emulation.
When HHH emulates itself emulating DDD the emulated HHH cannot possibly
return because each DDD keeps calling HHH to emulate itself again until
the outer executed HHH kills the whole emulated process at the very
first emulated DDD before it ever reaches its own second line.

Why is the abort not simulated?

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.