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

On 5/4/2025 2:21 PM, Richard Heathfield wrote:

On 04/05/2025 18:55, olcott wrote:

Changing my words then rebutting these changed
words is dishonest.
>
Functions computed by Turing Machines require INPUTS
and produce OUTPUTS DERIVED FROM THESE INPUTS.

 Counter-example: a Turing Machine can calculate pi without any input whatsoever.
 As Mikko rightly said: a Turing machine does not need to require an input.
 

IT IS NOT COMPUTING FUNCTION THEN
IT IS NOT COMPUTING FUNCTION THEN
IT IS NOT COMPUTING FUNCTION THEN
IT IS NOT COMPUTING FUNCTION THEN
Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithms, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.e. given an input of the function domain it can return the corresponding output.
https://en.wikipedia.org/wiki/Computable_function
given an input of the function domain it can return the corresponding output.
given an input of the function domain it can return the corresponding output.
given an input of the function domain it can return the corresponding output.
*Computer science is ONLY concerned with computable functions*
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer