XPost: comp.theory, sci.logic, sci.math
#include <stdint.h>
typedef void (*ptr)();
int H(ptr x, ptr y)
{
x(y); // direct execution of P(P)
return 1;
}
// Minimal essence of Linz(1990) Ĥ
// and Strachey(1965) P
int P(ptr x)
{
H(x, x);
return 1;
}
int main(void)
{
H(P, P);
}
Of every possible H that can possibly exist from H[0]...H[N]
(a) Called from the above P.
(b) Simulates or Executes its input.
(c) Aborts this input at some point or not.
No P ever returns any value, thus P never halts.
To create a halt decider H(P,P) H merely needs to see that P is calling
H with the same parameters that H was called with, this specifying
infinite recursion.
This would be an (a), (b1), (c1) instance of the above set of every
possible H.
Halting problem undecidability and infinitely nested simulation (V2)
https://www.researchgate.net/publication/356105750_Halting_problem_undecidability_and_infinitely_nested_simulation_V2
--
Copyright 2021 Pete Olcott
Talent hits a target no one else can hit;
Genius hits a target no one else can see.
Arthur Schopenhauer
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)