Sujet : Re: Proof that DD correctly simulated by HH provides the correct halt status criteria
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory sci.logicDate : 08. Jun 2024, 00:20:28
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v4013c$287qb$5@dont-email.me>
References : 1 2
User-Agent : Mozilla Thunderbird
On 6/7/2024 4:59 PM, Python wrote:
Le 07/06/2024 à 23:48, olcott a écrit :
*That no counter-example to the following exists proves that it is true*
*That no counter-example to the following exists proves that it is true*
*That no counter-example to the following exists proves that it is true*
>
Try to show how this DD correctly simulated by any HH ever
stops running without having its simulation aborted by HH.
>
_DD()
[00001e12] 55 push ebp
[00001e13] 8bec mov ebp,esp
[00001e15] 51 push ecx
[00001e16] 8b4508 mov eax,[ebp+08]
[00001e19] 50 push eax ; push DD
[00001e1a] 8b4d08 mov ecx,[ebp+08]
[00001e1d] 51 push ecx ; push DD
[00001e1e] e85ff5ffff call 00001382 ; call HH
>
A {correct simulation} means that each instruction of the
above x86 machine language of DD is correctly simulated
by HH and simulated in the correct order.
"correctly" is used in the definition of "correct": this
is not a definition.
You have somewhat of a point there, yet the words that I have said
are more easily understood as they are and would be confusing to
some of my readers if I made them much more precise.
*More precise and more cumbersome*
Each machine language instruction of DD is emulated by a third
party x86 emulator to perform the semantics specified by this
x86 machine language instruction including any and all control
flow operations that leave the first instruction of the machine
language of DD.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer