Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs +++
De : dbush.mobile (at) *nospam* gmail.com (dbush)
Groupes : comp.theoryDate : 04. May 2025, 22:07:39
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vv8kuq$2qnqk$2@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 27 28 29
User-Agent : Mozilla Thunderbird
On 5/4/2025 4:06 PM, olcott wrote:
Computable functions REPORT ON WHAT THEIR INPUT ACTUALLY SPECIFIES
not some twisted delusion.
Category error. Computable functions are simply a mapping from an input domain to an output domain that an algorithm is able to compute, nothing more. There is no "reporting".
Algorithms can compute computable functions.
But no algorithm can compute the halting function, as Linz and others have proved and as you have *explicitly* agreed is correct.