Liste des Groupes | Revenir à theory |
On 2024-07-14 14:13:41 +0000, olcott said:Not for the subset of inputs that we are examining.
On 7/14/2024 3:40 AM, Mikko wrote:No, it is not. As stated on the Subject line, the subject is correctness ofOn 2024-07-13 12:22:24 +0000, olcott said:>>>
Deciders are required to (thus must) halt.
The semantics of the x86 language does not require that, nor that any of
the programs is a decider.
The subject our our conversion is a simulating termination
analyzer
the rejection of DDD as non-halting.
AKA partial halt deciderThat "AKA" is incorrect. The term "termination analyzer" means a program
of a certain kind and the term "partial halt decider" means a program of
a different kind.
Partial halt decider / termination analyzer HHH has thesethat accepts a finite string of x86 code as specifying halting behaviorHowever, that is not sufficient. The decider must not accpet inputs that
or rejects this finite string. Deciders are required to halt thus must
abort the emulation of any input that would prevent this.
its specification does not specify as acceptable and must not reject inputs
that its specification does not specify as rejectable. As you call your
program a "partial halt decider" you should also specify how it is partial,
i.e., what inputs it is required to answer the same whay as a halt decider
and what it may do with the other inputs.
Les messages affichés proviennent d'usenet.