Sujet : Re: D correctly simulated by H proved for THREE YEARS --- finite string transformation rules
De : noreply (at) *nospam* example.com (joes)
Groupes : comp.theory alt.crackpotDate : 13. Jun 2024, 10:52:58
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v4ec1a$3rbs4$6@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Wed, 12 Jun 2024 18:12:34 -0500 schrieb olcott:
On 6/12/2024 5:59 PM, Richard Damon wrote:
On 6/12/24 12:50 PM, olcott wrote:
On 6/12/2024 6:33 AM, Richard Damon wrote:
On 6/11/24 11:34 PM, olcott wrote:
On 6/11/2024 9:32 PM, Richard Damon wrote:
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 :
The actual behavior of the input to H(D,D) is the truthmaker for halt
decider H.
Which is DEFINED to be the behavior of the program described by the
input when directly run.
*If that was true then you could show ALL OF THE DETAILED STEPS*
*of the mapping that H(D,D) computes to derive that behavior*
Any UTM/simulator does it. But H must halt, so it's wrong on non-
terminating inputs.
-- joes
…