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

On 5/20/2024 12:48 PM, olcott wrote:

On 5/20/2024 2:44 PM, Chris M. Thomasson wrote:

On 5/20/2024 12:40 PM, olcott wrote:

On 5/20/2024 2:38 PM, Chris M. Thomasson wrote:

[...]

So, your thing will tell me if a program XYZ will halt or not only _after_ it simulates to infinity? What am I missing here?

>
*The 100% totally complete every single detail scope of my post*
*The 100% totally complete every single detail scope of my post*
*The 100% totally complete every single detail scope of my post*
>
typedef int (*ptr)();  // ptr is pointer to int function
00 int H(ptr p, ptr i);
01 int D(ptr p)
02 {
03   int Halt_Status = H(p, p);
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 }
[...]
For 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.
>
>

>
Define H?

 I have two fully operational examples of H that have been fully
operational for years. I am not talking about those. I am only
talking this:
 typedef int (*ptr)();  // ptr is pointer to int function
00 int H(ptr p, ptr i);
01 int D(ptr p)
02 {
03   int Halt_Status = H(p, p);
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 }
 Every element of an infinite set of H/D pairs matching the above
template where H correctly simulates 1 to ∞ steps of D thus including
0 to ∞ recursive simulations of H simulating itself simulating D.
*D correctly simulated by H never reaches its own line 06 and halts*
 

Can I create a program that your simulator will correctly say, halts or not? If so, how? How does your simulator call into my program? Where do I begin execution?