XPost: comp.theory, sci.logic, sci.math
What happens when the Linz H is applied to its own Turing machine
description under the following conditions ?
H.q0 ⟨H⟩ ⟨H⟩ ⊢* H.qy
H.q0 ⟨H⟩ ⟨H⟩ ⊢* H.qn
We hypothesize that the Linz H computes the mapping from its input
finite string pair to its own final states on the basis of the behavior
of its pure simulation of N steps of its input.
H performs a pure simulation of its input until:
(a) Its input halts on its own, then H transitions to H.qy.
(b) H determines that the pure simulation of its input would never halt
on its own. H aborts its simulation and transitions to H.qn.
(b) The pure simulation of its input would never halt on its own. H
aborts its simulation and transitions to H.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)