Sujet : Re: D correctly simulated by H proved for THREE YEARS --- rewritten
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theory sci.logicDate : 12. Jun 2024, 03:32:35
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v4b1c3$3nf9n$3@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11
User-Agent : Mozilla Thunderbird
On 6/11/24 8:57 PM, olcott wrote:
On 6/11/2024 7:20 PM, Python wrote:
Le 12/06/2024 à 01:23, olcott a écrit :
...
It turns out that by the generic definition of a decider
what the directly executed D(D) does is not any of the
business of H.
>
LOL
>
There are no finite string transformations from the input
to H to the behavior of D(D), thus the behavior of D(D)
is irrelevant.
Of course there is.
That is exactly what the definition of a UTM is.
It will transform the input string into the behavior of the directly executed machine.
Your H just needs to figure out what that behavor would be.
It CAN be done for many (but not all) inputs. The not-all is what makes the problem uncomputable, which seems to put it outside your ability to understand it.
…