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

On 2025-05-05 00:41:54 +0000, olcott said:

On 5/4/2025 5:27 PM, Mr Flibble wrote:

On Sun, 04 May 2025 17:15:04 -0500, olcott wrote:
 

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*

 Computer science is also concerned with intractable problems.
 /Flibble

 I think the computability aspect of computer science
is only concerned with computable functions.

Both computable and uncomputable functions are concerned at least to
the extent of whether they are or can be determined to be computable
or uncomputable.
--
Mikko