Re: Can you see that D correctly simulated by H remains stuck in recursive simulation?

On 5/23/2024 4:52 PM, Sam wrote:

olcott writes:
 

typedef int (*ptr)();  // ptr is pointer to int function in C
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       }

 Anyone who writes something like this, in my day job, will get fired before the end of the day.
 This is the worst chunk of code I've seen in at least fifteen years. It shows a complete lack of understanding of fundamental principles of C and C++.
 

It is the computer science of the Peter Linz halting
problem proof translated into C. This too is a template:
When Ĥ is applied to ⟨Ĥ⟩
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
I simplified the Linz notation and this simplification
has been validated.
*I tried to avoid going off topic, but you insisted*
https://www.liarparadox.org/Linz_Proof.pdf
Can we please get back to the C or do you really want
to stay off topic?
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer