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

On 30/04/2025 18:32, olcott wrote:

On 4/30/2025 11:11 AM, Richard Heathfield wrote:

On 30/04/2025 16:44, joes wrote:

Am Wed, 30 Apr 2025 10:09:45 -0500 schrieb olcott:

On 4/29/2025 5:01 AM, Mikko wrote:

>

Irrelevant. There is sufficient agreement what Turing machines are.

>
Turing machine computable functions must apply finite string
transformation rues to inputs to derive outputs.
>
This is not a function that computes the sum(3,2):
int sum(int x, int y) { return 5; }

Yes it is, for all inputs.

>
Not much of a computation, though, is it?
>

 It IS NOT a Turing Computable function

Are you saying that 5 can't be computed? You're braver than I thought.

because it does not ever apply any finite
string transformation  rules to its inputs.

If you'd bothered to read the article, you'd have seen that I addressed that point.

THE OUTPUTS MUST CORRESPOND TO THE INPUTS.
sum(4,3) returns 5 proving that sum is
not a Turing Computable function.

Not so. It just shows that sum() ignores its input and returns a constant. That's a perfectly computable function.
--
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