Re: Can someone please verify the execution trace of this?

On 5/20/2024 7:37 AM, wij wrote:

On Sun, 2024-05-19 at 21:43 -0500, olcott wrote:

On 5/19/2024 8:52 PM, Bonita Montero wrote:

Am 19.05.2024 um 21:00 schrieb olcott:

On 5/19/2024 1:08 PM, Bonita Montero wrote:

Am 18.05.2024 um 23:40 schrieb olcott:

People are saying that they have no idea what this code does
because they do not believe it conforms to c11 or c17.
>
typedef int (*ptr)();  // ptr is pointer to int function
00 int H(ptr x, ptr y);
01 int D(ptr x)
02 {
03   int Halt_Status = H(x, x);
04   if (Halt_Status)
05     HERE: goto HERE;
06   return Halt_Status;
07 }
08
09 int main()
10 {
11   H(D,D);
12   return 0;
13 }
>
In the above case a simulator is an x86 emulator that correctly
emulates
at least one of the x86 instructions of D in the order specified by the
x86 instructions of D.
>
This may include correctly emulating the x86 instructions of H in the
order specified by the x86 instructions of H thus calling H(D,D) in
recursive simulation.
>
*Execution Trace*
Line 11: main() invokes H(D,D);
>
*keeps repeating* (unless aborted)
Line 01:
Line 02:
Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
>
*Simulation invariant*
D correctly simulated by H cannot possibly reach past its own line 03.
>
The key thing to note is that no D correctly simulated by any H of
every
H/D pair specified by the above template ever reaches its own line 06
and halts.
>

>
Other people think 30s about this, you think years about that.
>

>
It is the basis for my two decades long primary research into
termination analysis. People on another forum have written
hundreds of posts claiming that D correctly simulated by H
reaches its own line 06 and halts.
>
*I have only gotten truthful answers on this forum*
>

>
That's not research, that's nonsense.
>

>
This is not the forum to show that it is not nonsense this is
a simple C question that I should not even have to ask except
for a few people in another forum that consistently lie about
the answer.
>
I have been a professional C++ developer since Y2K. So I already
know the answer, I just need some competent people in this forum
to attest to this answer. I met Bjarne Stroustrup back when he
was going around the country promoting his new language.
>

 typedef int (*ptr)();  // ptr is pointer to int function
int H(ptr x, ptr y);
int D(ptr x)
{
   int Halt_Status = H(x, x);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
 int main()
{
   H(D,D);
   return 0;
}
 The code above does not compile:

*It does compile*
*It does compile*
*It does compile*
*It does compile*
typedef int (*ptr)();
int H(ptr P, ptr I);
int D(ptr x)
{
   int Halt_Status = H(x, x);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
int main()
{
   H(D,D);
   return 0;
}
cl  /GS- /std:c11 /c /arch:IA32 Test_Compile.c
cl  /GS- /std:c17 /c /arch:IA32 Test_Compile.c
if ERRORLEVEL 1 pause
D:\__HP_Stream\__NLU_Notes\__Work_In_Progress\__Halt_Decider_X86\___x86utm_VS>echo off
D:\__HP_Stream\__NLU_Notes\__Work_In_Progress\__Halt_Decider_X86\___x86utm_VS>REM 2022
D:\__HP_Stream\__NLU_Notes\__Work_In_Progress\__Halt_Decider_X86\___x86utm_VS>call "C:\Program Files\Microsoft Visual Studio\2022\Community\Common7\Tools\VsDevCmd.BAT"
**********************************************************************
** Visual Studio 2022 Developer Command Prompt v17.6.4
** Copyright (c) 2022 Microsoft Corporation
**********************************************************************
Microsoft (R) C/C++ Optimizing Compiler Version 19.36.32535 for x86
Copyright (C) Microsoft Corporation.  All rights reserved.
Test_Compile.c
Microsoft (R) C/C++ Optimizing Compiler Version 19.36.32535 for x86
Copyright (C) Microsoft Corporation.  All rights reserved.
Test_Compile.c
Press any key to continue . . .

1. D does not fit the protocol H accepts --> After there years, you finally
    learn to use typedef but still not seem to understand it.

That is false too. H has been fully implemented with
that protocol for a year.

2. H is not defined --> cannot compile to executable
 

I am asking about the behavior of
every H/D pair of the above template D correctly simulated by pure function (thus computable function) H cannot possibly reach its own final state at line 06 and halt.

You are trapped in an infinite recursive call.
You finally know it is an infinite recursive call. But the Halting Problem
asks for a program to answer the halting question, NOT YOU to answer the
question. According to GUR, even the H were your god, he neither can provide
the correct answer.
 

This is a fully operational version from three years ago that
proves it does get the right answer on pages 4-5 of the paper.
*Quoted from page 4 of the paper linked below*
// Simplified Linz Ĥ (Linz:1990:319)
// Strachey(1965) CPL translated to C
void P(u32 x)
{
   if (H(x, x))HERE:
    goto HERE;
}
int main()
{
   Output("Input_Halts = ", H((u32)P, (u32)P));
}
That P is correctly simulated by H is proven by the fact that
every assembly language instruction of P is correctly simulated
by H in the order specified by the x86 assembly language of P
even when H correctly simulates itself simulating P.
All of the details of this (except the 354 page execution
trace of H) are shown on pages 4-5 of the following paper.
*Halting problem undecidability and infinitely nested simulation*
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation --
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer