XPost: comp.theory, sci.logic, sci.math
The following is the exact Linz Ĥ applied to its own Turing machine description except that the infinite loop appended to the YES path has
been removed.
Ḧq0 ⟨Ḧ⟩ ⊢* Ḧ.qx ⟨Ḧ⟩ ⟨Ḧ⟩ ⊢* Ḧ.qy
Ḧq0 ⟨Ḧ⟩ ⊢* Ḧ.qx ⟨Ḧ⟩ ⟨Ḧ⟩ ⊢* Ḧ.qn
The copy of H at Ḧ.qx maps ⟨Ḧ⟩ ⟨Ḧ⟩ to a final state on the basis of the
behavior of the pure simulation of N steps of ⟨Ḧ⟩ applied to ⟨Ḧ⟩
It performs a pure simulation of its input until:
(a) Its input halts on its own, then it transitions to Ḧ.qy.
(b) It determines that the pure simulation of its input would never halt
on its own, then it aborts its simulation and transitions to Ḧ.qn.
https://www.liarparadox.org/Peter_Linz_HP_315-320.pdf
Linz, Peter 1990. An Introduction to Formal Languages and Automata. Lexington/Toronto: D. C. Heath and Company. (315-320)
--
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)