Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs --- MT
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 07. May 2025, 20:02:24
Autres entêtes
Organisation : Fix this later
Message-ID : <vvgao0$158tp$7@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
User-Agent : Mozilla Thunderbird
On 07/05/2025 19:47, olcott wrote:
<snip>
HHH did not abort its input. That is the ONLY way that
simulating halt deciders can possibly work.
Another only is that simulating halt deciders (like code-parsing halt deciders) can only possibly work if they don't claim to be universal.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within