Re: Proof that DD correctly simulated by HH provides the correct halt status criteria

Liste des GroupesRevenir à s logic 
Sujet : Re: Proof that DD correctly simulated by HH provides the correct halt status criteria
De : python (at) *nospam* invalid.org (Python)
Groupes : comp.theory sci.logic
Date : 07. Jun 2024, 23:59:08
Autres entêtes
Organisation : CCCP
Message-ID : <v3vvrc$27qug$3@dont-email.me>
References : 1
User-Agent : Mozilla Thunderbird
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.

Anyone claiming that HH should report on the behavior
of the directly executed DD(DD) is
basically mentally sane.
- This car don't start!
- It does !
- No it doesn't
- My car start decider says it does!
- But it doesn't!
- My car decider is right about what my car decider is
saying, so it is right!

requiring a violation
of the above definition of correct simulation.
There is not proper definition above.

Halt deciders are required to compute the mapping from their
input to their own accept or reject state based on the behavior
that this input specifies.
 Simulating halt deciders are not allowed to simulate non-halting
inputs for more than a finite number of steps because all deciders
must halt.
 The basic strategy of a simulating halt decider is to simulate
an input until (a) The input halts or (b) it correctly determines
that the correctly simulated input cannot possibly stop running
unless its simulation has been aborted.
if it could be done it would work. Big deal...
unfortunately it cannot be done.
End of Story.

Date Sujet#  Auteur
7 Jun 24 * Proof that DD correctly simulated by HH provides the correct halt status criteria7olcott
7 Jun 24 +* Re: Proof that DD correctly simulated by HH provides the correct halt status criteria2Python
8 Jun 24 i`- Re: Proof that DD correctly simulated by HH provides the correct halt status criteria1olcott
8 Jun 24 +- Re: Proof that DD correctly simulated by HH provides the correct halt status criteria1Richard Damon
8 Jun 24 `* Re: Proof that DD correctly simulated by HH provides the correct halt status criteria3Fred. Zwarts
8 Jun 24  `* Re: Proof that DD correctly simulated by HH provides the correct halt status criteria2olcott
8 Jun 24   `- Re: Proof that DD correctly simulated by HH provides the correct halt status criteria1Richard Damon

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal