Sujet : Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs --- MT
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 07. May 2025, 20:59:19
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvge2n$15e69$10@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 5/7/2025 2:02 PM, Richard Heathfield wrote:
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.
That is why I switched to "termination analyzer" as
long as it correctly determines the halt status on one
single input that has no inputs then it is correct.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer