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

On 4/22/2025 2:26 PM, Fred. Zwarts wrote:

Op 22.apr.2025 om 20:43 schreef olcott:

On 4/22/2025 10:22 AM, Fred. Zwarts wrote:

Op 22.apr.2025 om 16:07 schreef olcott:

On 4/22/2025 7:40 AM, joes wrote:

Am Mon, 14 Apr 2025 18:50:52 -0500 schrieb olcott:

On 4/14/2025 4:32 AM, joes wrote:

Am Sun, 13 Apr 2025 14:54:35 -0500 schrieb olcott:

On 4/13/2025 9:46 AM, joes wrote:

Am Thu, 03 Apr 2025 16:57:43 -0500 schrieb olcott:

On 4/3/2025 1:32 AM, Mikko wrote:

On 2025-04-03 02:08:22 +0000, olcott said:

It is a truism that a correct x86 emulator would emulate
itself emulating DDD whenever DDD calls this emulator with
itself.

Which does not agree or disagree with my comment nor say anything
about it,
and it doesn't clarify any aspect of your statement that i
commented.
If there is any indirect connection to anything relevant that
connection is not presented, leaving your response unconnected and
therefore irrelevant.
So you did not reply to the immediated context.

THE FACT THAT DDD EMULATED BY HHH DOES NOT HALT IS NOT RELEVANT TO A
CORRECT DECISION BY A HALT DECIDER?

Yes.

To clarify: that *HHH* does not simulate DDD halting has no bearing on
its direct execution.

THE DIRECT EXECUTION IS NOT WHAT IT SEES THUS FORBIDDING IT FROM
REPORTING ON THE DIRECT EXECUTION.

It sure ought to see the same thing the directly executing processor does.
>

>
HHH cannot possibly see what HHH1.
>

>
Yes, the programmer made HHH such that it cannot see the behaviour.

>
typedef void (*ptr)();
int HHH(ptr P);
int HHH1(ptr P);
>
int DD()
{
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
>
int main()
{
   HHH1(DD);
}
>
It is stupid to think that HHH can see anything
that it caller does.

 It is stupid to think that when HHH is made blind for some facts by the programmer, that these facts are not true.
 

If HHH can see any aspect of its caller then this
violates the requirements of a computable function.
a function is computable if there exists an algorithm
that can do the job of the function, i.e. given an input
of the function domain it can return the corresponding output.
https://en.wikipedia.org/wiki/Computable_function
*THE SOFTWARE ENGINEERING EQUIVALENT OF A COMPUTABLE FUNCTION*
In computer programming, a pure function is a function
that has the following properties:
the function return values are identical for identical
arguments (no variation with local static variables,
non-local variables, mutable reference arguments or
input streams, i.e., referential transparency), and
the function has no side effects (no mutation of local
static variables, non-local variables, mutable reference
arguments or input/output streams).
https://en.wikipedia.org/wiki/Pure_function
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer