Re: Every D(D) simulated by H presents non-halting behavior to H ###

On 2024-05-28 14:37:15 +0000, olcott said:

On 5/28/2024 2:17 AM, Mikko wrote:

On 2024-05-27 13:52:09 +0000, olcott said:
 

On 5/27/2024 3:11 AM, Mikko wrote:

On 2024-05-26 16:50:21 +0000, olcott said:
 

 <snip>
So that: *Usenet Article Lookup*
http://al.howardknight.net/
can see the whole message now that
*the Thai spammer killed Google Groups*
 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       }
 

When we see that D correctly simulated by pure simulator H would remain
stuck in recursive simulation then we also know that D never reaches its
own line 06 and halts in less than an infinite number of correctly
simulated steps.

 Which means that H never terminates. You said that by your definition
a function that never terminates is not a pure function. Therefore
H, if it exists, is not a pure function, and the phrase "pure function
H" does not denote.

 *I should have said that more clearly*
*That is why I need reviewers*

 What is said here has little significance. You should ask reviewer's
comments about your working draft that you maintain in GitHub or some
other web site. And you should update that draft when a reviewer finds
some something wrong or unclear.
 

*This is STEP ONE of my four step proof*
STEP TWO applies these same ideas to the Peter Linz HP proof.
STEP THREE shows how the Linz Ĥ.H sees the behavior of its recursive
      simulations.
STEP FOUR shows why the behavior of the INPUT is the correct basis.

 When discussing individual steps of a proof draft you shold start
at the last step.

 I have been at this for twenty years.
Ben Bacarisse has spoken with me for 15 of those years.
 What I found out is that exactly one point of one step
must be pursued until complete closure of that one point
of that one step.

How long do you think it takes to cover them all, starting
from the first?
How long do you think it would take, starting from the last?
--
Mikko