Sujet : Re: Turing Machine computable functions apply finite string transformations to inputs VERIFIED FACT
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 29. Apr 2025, 21:23:05
Autres entêtes
Organisation : Fix this later
Message-ID : <vurcf9$2gjie$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 29/04/2025 20:57, olcott wrote:
On 4/29/2025 10:33 AM, Fred. Zwarts wrote:
<snip>
makes it impossible for H to see the behaviour of P(D).
The behaviour of P(D) does not change, but H does not see it.
H MUST REPORT ON THE BEHAVIOR THAT IT DOES SEE
H has the whole P tape and the whole D tape at its disposal. There is nothing it can't inspect.
Not being able to see how P behaves in simulation is no excuse for getting the answer wrong. If because of limitations in H it fails to spot behaviour that would have changed its report on P(D), that just means that H is broken.
But don't bother trying to fix it. Turing has already proved that you can't.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within