Sujet : Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 29. Apr 2025, 20:06:22
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vur7vd$2dvvs$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 27 28 29
User-Agent : Mozilla Thunderbird
On 4/29/2025 8:46 AM, Richard Heathfield wrote:
On 29/04/2025 14:11, olcott wrote:
On 4/29/2025 2:10 AM, Richard Heathfield wrote:
On 29/04/2025 03:50, olcott wrote:
<snip>
Yet it is H(P,D) and NOT P(D) that must be measured.
>
Nothing /has/ to be measured. P's behaviour (halts, doesn't halt) when given D as input must be /established/.
>
No H can possibly see the behavior of P(D)
It doesn't have to.
IF IT CAN'T SEE IT THEN IT CAN'T REPORT ON IT.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer