Sujet : Re: Proof that DDD specifies non-halting behavior --- reviewers disagree with basic facts
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 16. Aug 2024, 22:08:05
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v9of3l$1i745$3@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
User-Agent : Mozilla Thunderbird
On 8/16/2024 3:54 PM, Richard Damon wrote:
On 8/16/24 4:36 PM, olcott wrote:
>
I break my points down to the basic facts of the semantics
of the x86 language and the basic facts of the semantics
of the C programming.
>
I can't ever get to the point of the computer science
because reviewers disagree with these basic facts.
No, the problem is that your "facts" just disagree with the computere science you claim to be doing.
We never get anywhere near the computer science because
people disagree with 100% concrete fully specified semantics.
If they disagree with arithmetic we can never get to algebra.
>
void DDD()
{
HHH(DDD);
}
>
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
Which is NOT a program
I am talking above the behavior of the C function it is
dishonest to change the subject as any basis of rebuttal.
and can not be the complete input to HHH, in fact, HHH takes the whole of memory being uses as its "finite string" input, or your problem is just falsely stated.
The question is can DDD emulated by HHH according to the
semantics of the x86 language even stop running without
being aborted?
Ben is the only one that did not attempt some kind of
dishonesty on this question.
>
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
If simulating halt decider H correctly simulates its input D
until H correctly determines that its simulated D would never
stop running unless aborted then
Right, and to statisfy this, since the only simulation that is "Correct" for the determining of the behavior of a program is a COMPLETE behaivior
UNTIL MEANS LIMITED.
IT DOES NOT MEAN YOUR MISCONCEPTION OF "COMPLETE"
YOU DON'T EVEN UNDERSTAND THAT AN INFINITE
EXECUTION CANNOT BE COMPLETE. YOU AND OTHERS
ALWAYS USE THE TERM "COMPLETE" INCORRECTLY
THIS IS NO ORDINARY MISTAKE IT IS A STUPID MISTAKE.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer