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

On 03/05/2025 02:16, Mike Terry wrote:

For your point of view I could probably just have said "It's bleedin' obvious that the input D can't be changed to D' (or anything else) half way through interpreting Sipser's words".

Yes, that would cover it.

Also probably that would be enough for you to get that your interpretation of "changing the input" went down the wrong road...

More than enough.
In passing, when I nailed down "TL;DR" I felt mildly guilty for scoring so few tersinosity points, but in return I must accuse you of undue obscurity.
TL;DR appears to have attracted a certain currency, so okay, but... NTLFM? Really? "Seek and ye shall find", so I sought but shall findethed not. Most of my best guesses started 'Now The' and ended rhyming with RTFM, but none of those guesses jumped out as being self-evidently right. Would you care to translate?

I kind of disagree with your mild denigration of the Linz (and similar) proofs.

I wish to clarify that denigration was most certainly not my intent. There is, however, no doubt in my mind that while Linz is undoubtedly a worthy and indeed admirable computer scientist, his proof stands on giant shoulders. All I meant to say was that, were Linz's proof to lose its balance and take a tumble, it would not be the fault of the shoulders.
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within