Liste des Groupes | Revenir à c theory |
On 7/12/2024 3:03 AM, Mikko wrote:How can one derive "must" from the semantics of the machine code?On 2024-07-11 14:10:24 +0000, olcott said:The semantics of the language specifies the behavior of
On 7/11/2024 1:25 AM, Mikko wrote:There is not "must" anywhere in the semantics of the programming language.On 2024-07-10 17:53:38 +0000, olcott said:*That is counter-factual*
On 7/10/2024 12:45 PM, Fred. Zwarts wrote:However, each of those instances has the same sequence of instructionsOp 10.jul.2024 om 17:03 schreef olcott:Every time any HHH correctly emulates DDD it calls thetypedef void (*ptr)();Unneeded complexity. It is equivalent to:
int HHH(ptr P);
void DDD()
{
HHH(DDD);
}
int main()
{
HHH(DDD);
}
int main()
{
return HHH(main);
}
x86utm 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.
that the x86 language specifies the same operational meaning.
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.
the machine code thus deriving the must.
Les messages affichés proviennent d'usenet.