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 : 21. Jun 2024, 18:55:47
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v54er3$394bf$2@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12
User-Agent : Mozilla Thunderbird
On 6/21/2024 12:40 PM, Richard Damon wrote:
On 6/21/24 1:22 PM, olcott wrote:
>
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).
But there *IS* a mapping, it just isn't a COMPUTABLE MAPPING.
If there is a mapping yet not a computable mapping then
the actual halt decider cannot even see the question that
the textbooks expect it to see.
This is not the same thing as the inability to correctly
answer this question. This is something brand new that has
never been thought of before.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer