Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs --- MT

Mike Terry <news.dead.person.stones@darjeeling.plus.com> writes:
...

As explained above, UTM(⟨Ĥ⟩ ⟨Ĥ⟩) simulates Ĥ run with input Ĥ (having the
same halting behaviour) and Ĥ run with input Ĥ HALTS.  So embedded_H does
not "gather enough information to deduce that UTM(⟨Ĥ⟩ ⟨Ĥ⟩) would never
halt".  THAT IS JUST A FANTASY THAT YOU HAVE.
>
UTM(⟨Ĥ⟩ ⟨Ĥ⟩) DOES halt, so embedded_H can't possibly gather information
that genuinely implies it DOESN'T halt.  The explanation is obvious:
embedded_H gathers information that *YOU* believe implies that UTM(⟨Ĥ⟩ ⟨Ĥ⟩)
would never halt, but *YOU ARE SIMPLY WRONG*.

He used to claim that false ("does not halt") was the correct answer,
/even though/ the computation in question halts!  Those were simpler
days.  Of course cranks will never admit to having been wrong about
anything other than a detail or two, so anyone who could be bothered
could try to get him to retract that old claim.

I know you'll not understand what I've just said, because it is all too
abstract and you don't understand the concepts involved, and consequently
you probably don't agree with my Sipser interpretation, and even if you did
I doubt you would be able to work out its consequences.  So I don't expect
to be posting any further.

Not you then!  I sympathise, though my reason for not talking to him is
his unacceptable insults.

--
Ben.