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

On 4/26/25 11:59 AM, olcott wrote:

On 4/26/2025 3:19 AM, Mikko wrote:

On 2025-04-25 16:31:58 +0000, olcott said:
>

On 4/25/2025 3:46 AM, Mikko wrote:

On 2025-04-24 15:11:13 +0000, olcott said:
>

On 4/23/2025 3:52 AM, Mikko wrote:

On 2025-04-21 23:52:15 +0000, olcott said:
>

Computer Science Professor Eric Hehner PhD
and I all seem to agree that the same view
that Flibble has is the correct view.

>
Others can see that their justification is defective and contradicted
by a good proof.
>
Some people claim that the unsolvability of the halting problem is
unproven but nobody has solved the problem.

>
For the last 22 years I have only been refuting the
conventional Halting Problem proof.

>
Trying to refute. You have not shown any defect in that proof of the
theorem. There are other proofs that you don't even try to refute.

>
Not at all. You have simply not been paying enough attention.
>
Once we understand that Turing computable functions are only
allowed

>
Turing allowed Turing machines to do whatever they can do.
>

 Strawman deception error of changing the subject away
from computable functions.
 Turing Machine Computable Functions are not allowed
to output anything besides the result of applying
finite string transformations to their input.
>

No, they are not ABLE to output something other than what their algorithm definie transformation generates.
They requirements might require something that can't be done by that, in which case the requirement can be determined to be uncomputable, which is a VALID result in computability theory, as that is the ultimate question, WHICH functions are computable, and which ones are not.