Sujet : Re: Turing Machine computable functions MUST apply finite string transformations to inputs
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 02. May 2025, 03:25:33
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vv1aet$4a4k$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
User-Agent : Mozilla Thunderbird
On 5/1/2025 9:10 PM, André G. Isaak wrote:
On 2025-05-01 19:55, olcott wrote:
Specify every single step of the mapping and you will
see that it has never been well defined. It has ONLY
ever been a leap to a conclusion.
Mappings don't HAVE steps. Again, you are confusing functions with algorithms.
André
In other words people just guess that a mapping exists or not?
THE MAPPING FROM INPUTS TO OUTPUTS IS BY FINITE STRING TRANSFORMATIONS.
The mapping to compute the sum function is from integers
transformed by the steps of arithmetic to an integer OUTPUT.
int sum(int x, int y) { return 5; }
The above mapping IS NOT for the sum function.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer