Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT

olcott <polcott333@gmail.com> writes:

On 4/30/2025 2:46 PM, Keith Thompson wrote:

olcott <polcott333@gmail.com> writes:
[...]

Because you don't pay any attention at all
you did not bother to notice that I have never been
attacking the Halting Problem only the conventional
Halting Problem proof.

[...]
That's some interesting news, at least to me.
I was under the impression that you had explicitly claimed to have
solved the Halting Problem.  I don't read most of what you write,
and I don't remember all of what I've read, so my impression may
have been mistaken.
Now you're saying that you're only attacking the conventional proof.

>
That is ALL that I have been saying for several years.
Anyone can figure that out simply on the basis of
actually paying attention to my proof.
>
HHH(DD) does correctly report that the halting problem
proof's impossible input DOES NOT HALT SO THE PROOF
IS WRONG.

So your only claim is that the commonly known Halting Problem proof
is flawed.  (Others who have paid more attention might choose to
comment on that.)

Do you have anything to say about whether the Halting Problem
is solvable?  (You snipped this question in your previous response.)

--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */