Re: A simulating halt decider applied to the The Peter Linz Turing Machine description ⟨Ĥ⟩

When Ĥ is applied to ⟨Ĥ⟩
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
  Ĥ copies its own Turing machine description: ⟨Ĥ⟩
  then invokes embedded_H that simulates ⟨Ĥ⟩ with ⟨Ĥ⟩ as input.
It is an easily verified fact that ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by
embedded_H cannot possibly reach its own simulated final state of
⟨Ĥ.qn⟩ in any finite sequence of steps such as Googolplex ^ Googolplex
number of steps. https://en.wikipedia.org/wiki/Googolplex
UNLESS YOU CAN PROVE THAT A UTM CANNOT POSSIBLY BE ADAPTED TO COUNT
THE NUMBER OF STEPS AND THEN STOP I AM CORRECT AND YOU ARE DISHONEST
*Your dishonest dodge strawman deception is not me lying*
*Your dishonest dodge strawman deception is not me lying*
*Your dishonest dodge strawman deception is not me lying*
UNLESS YOU CAN PROVE THAT A UTM CANNOT POSSIBLY BE ADAPTED TO COUNT
THE NUMBER OF STEPS AND THEN STOP I AM CORRECT AND YOU ARE DISHONEST
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer