Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply

Liste des GroupesRevenir à theory 
Sujet : Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theory sci.logic
Date : 21. Jun 2024, 19:26:25
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v54d41$lkkc$6@i2pn2.org>
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 29 30 31 32 33
User-Agent : Mozilla Thunderbird
On 6/21/24 1:16 PM, olcott wrote:
On 6/21/2024 12:06 PM, Richard Damon wrote:
On 6/21/24 12:56 PM, olcott wrote:
On 6/21/2024 9:36 AM, Richard Damon wrote:
On 6/21/24 12:01 AM, olcott wrote:
>
>
_DDD()
[00002093] 55               push ebp
[00002094] 8bec             mov ebp,esp
[00002096] 6893200000       push 00002093 ; push DDD
[0000209b] e853f4ffff       call 000014f3 ; call HH0
[000020a0] 83c404           add esp,+04
[000020a3] 5d               pop ebp
[000020a4] c3               ret
Size in bytes:(0018) [000020a4]
>
>
That is the only definitive way to determine the
actual behavior that the finite string specifies.
>
>
It is the only was to COMPUTE the actual behavior, but to DETERMINE it doesn't need that.
>
>
Ah so you expect that HH0 must use its intuition to
determine that behavior that it is supposed to report on.
>
>
>
Nope, if it exists, it needs to compute the answer. But, it doesn't need to exist as a correct decider for halting.
>
 If H(D,D) cannot apply finite string transformation rules
to its input finite string of x86 machine language of D to
derive the behavior of D(D) then H cannot even be asked
the question: Does D(D) halt?
You are just showing your STUPDIITY and IGNRNCE of the topic.
There is NOTHING about the definition of a quesiton of a mapping that we can ask a decider to try to compute that says the mapping must be computable.

 H(D,D) is being asked the question:
Must your correct simulation of D be aborted to prevent
your own non-termination?
Nope, it is being asked if the machine represented by its input will Halt when run.
You CLEARLY don't understand the nature of the problem, and are going back to your pathological lying.

 It answers that question correctly.
So, it is a correct POOP decider, but not a Halt Decide, so you are just lying about that.

 All undecidable decision problems make this same sort of mistake.
Incorrect yes/no questions have no correct yes/no answer.
 
Nope, YOU make that sort of mistake, becase you are just an ignorant pathological liar.
Try to show a reputable sourse that supports your claim.
I suspect you are going to end up having a lot of time to review your errors.

Date Sujet#  Auteur
10 Nov 24 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal