Sujet : Re: Turing Machine computable functions MUST apply finite string transformations to inputs
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 30. Apr 2025, 18:32:22
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vutmr6$nvbg$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12
User-Agent : Mozilla Thunderbird
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
because it does not ever apply any finite
string transformation rules to its inputs.
THE OUTPUTS MUST CORRESPOND TO THE INPUTS.
sum(4,3) returns 5 proving that sum is
not a Turing Computable function.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
…