Re: Turing Computations <are> finite string transformations of inputs

On 4/26/2025 4:03 PM, André G. Isaak wrote:

On 2025-04-25 21:28, olcott wrote:

On 4/25/2025 5:28 PM, André G. Isaak wrote:

On 2025-04-25 10:31, olcott wrote:
>

Once we understand that Turing computable functions are only
allowed to derived their outputs by applying finite string
operations to their inputs then my claim about the behavior
of DD that HHH must report on is completely proven.

>
You're very confused here.
>
Computable functions are *functions*. That is, they are mappings from a domain to a codomain, neither of which are required to be strings. Functions don't involve finite string operations at all.
>

>
All Turing Machine based computation applies the/
finite string transformations specified by the TM
language to the input finite string.

 Turing machines and computable functions are not the same thing. You keep conflating the two. The point of my post was to try to get you to be more careful with your terminology.
 André
 

Yes so I must correct my words to say
All Turing Machine based *Computable Functions* apply the
 >> finite string transformations specified by the TM
 >> language to the input finite string.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer