Liste des Groupes | Revenir à c theory |
Am Thu, 11 Jul 2024 09:10:24 -0500 schrieb olcott:On 7/11/2024 1:25 AM, Mikko wrote:On 2024-07-10 17:53:38 +0000, olcott said:On 7/10/2024 12:45 PM, Fred. Zwarts wrote:Op 10.jul.2024 om 17:03 schreef olcott:Contradicting yourself? "Counterfactual" usually means "if it were*That is counter-factual*>Every time any HHH correctly emulates DDD it calls the x86utmvoid DDD()Unneeded complexity. It is equivalent to:
{
HHH(DDD);
}
int main()
{
HHH(DDD);
}
int main()
{
return HHH(main);
}
operating system to create a separate process context with its own
memory virtual registers and stack, thus each recursively emulated DDD
is a different instance.
However, each of those instances has the same sequence of instructions
that the x86 language specifies the same operational meaning.
>
different".
When DDD is correctly emulated by HHH according to the semantics of the
x86 programming language HHH must abort its emulation of DDD or both HHH
and DDD never halt.
If the recursive call to HHH from DDD halts, the outer HHH doesn't needSure and when squares are round you can measure the radius of a square.
to abort.
DDD depends totally on HHH; it halts exactly when HHH does.Halting means reaching its own last instruction and
Which it does, because it aborts.
HHH must abort its simulation. HHH1 does not need toWhen DDD is correctly emulated by HHH1 according to the semantics of theWhere does HHH figure into this? It is not the simulator here.
x86 programming language HHH1 need not abort its emulation of DDD
because HHH has already done this.
The behavior of DDD emulated by HHH1 is identical to the behavior of theAt last!
directly executed DDD().
Les messages affichés proviennent d'usenet.