Re: Refutation of the Halting Problem Assuming the Self-Referential Paradox is a Category Error --- Linz Proof

On 4/26/2025 3:56 PM, Mr Flibble wrote:

Refutation of the Halting Problem Assuming the Self-Referential Paradox is
a Category Error in All Computational Models and the Mathematical Universe
Hypothesis is True
 

Yes and you are one of three people in the world that knows this.
You acquired expertise about this in about a year where most
people are indoctrinated into "received view" by mindless conformity.
Even Christ knew that people are sheep.
The other thing about the Halting Problem is that
a simulating halt decider proves that the contradictory
part has always been unreachable code.
When we apply the finite string transformation rules
specified by the Turing Machine language to the input
to the Linz proof we get
When Ĥ is applied to ⟨Ĥ⟩
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
(a) Ĥ copies its input ⟨Ĥ⟩
(b) Ĥ invokes embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩
(c) embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩
(d) simulated ⟨Ĥ⟩ copies its input ⟨Ĥ⟩
(e) simulated ⟨Ĥ⟩ invokes simulated embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩
(f) simulated embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩
(g) goto (d) with one more level of simulation
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer