Sujet : Re: key error in all the proofs --- Correction of Fred
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 17. Aug 2024, 07:42:52
Autres entêtes
Organisation : -
Message-ID : <v9pgpc$1qm46$1@dont-email.me>
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
User-Agent : Unison/2.2
On 2024-08-16 14:09:40 +0000, olcott said:
On 8/16/2024 8:34 AM, Mikko wrote:
On 2024-08-16 12:02:00 +0000, olcott said:
I must go one step at a time.
That's reasonable in a discussion. The one thing you were discussing
above is what is the meaning of the output of HHH. Its OK to stay
at that step until we are sure it is understood.
void DDD()
{
HHH(DDD);
return;
}
Unless an unlimited emulation of DDD by HHH
can reach the "return" instruction of DDD it is
construed that this instance of DDD never halts.
Whaatever you "construe" does not change the fact that DDD specifies
a halting computation if HHH does.
For three years now at least most reviewers insisted
on disagreeing with the semantics of the x86 language.
If you claim that HHH halts and DDD doesn't you disagree with
the semantics of both C and x86 languages.
-- Mikko