Sujet : Re: 195 page execution trace of DDD correctly simulated by HH0 ---Boilerplate Reply
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory sci.logicDate : 26. Jun 2024, 14:32:34
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v5h59i$24jbd$8@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14
User-Agent : Mozilla Thunderbird
On 6/26/2024 3:11 AM, joes wrote:
Am Tue, 25 Jun 2024 16:22:08 -0500 schrieb olcott:
On 6/25/2024 3:31 PM, joes wrote:
Am Fri, 21 Jun 2024 12:22:04 -0500 schrieb olcott:
When there is no mapping from the finite string x86 machine language
input to H(D,D) to the behavior of D(D) then H(D,D) IS NOT being asked
about the behavior of D(D).
It means that H can't do the mapping, i.e. it is not simulating
correctly.
It does a different map that doesn't fit its specification.
No that is incorrect. D correctly simulated by every H that can possibly
exist does not have the same behavior of any directly executed D(D) that
halts.
H1 simulates D the same way it would actually behave. Is that wrong?
When H1 simulates D there is no recursive simulation
because D calls H(D,D) and does not call H1(D,D).
When H simulates D there IS recursive simulation
because D calls H(D,D) and does not call H1(D,D).
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer