Liste des Groupes | Revenir à c theory |
On 5/24/2024 3:58 AM, Mikko wrote:You may call it a "diagnostic criterion" or just a "criterion" butOn 2024-05-23 13:18:02 +0000, olcott said:It provides a clear and correct criterion measure to utterly
On 5/23/2024 5:06 AM, Mikko wrote:There is no "standard of incorrect simulation".On 2024-05-22 14:51:50 +0000, olcott said:I must use those words or a standard of incorrect simulation
On 5/22/2024 2:39 AM, Mikko wrote:Maybe but I don't promise that the response to the incorrect answerOn 2024-05-21 13:54:09 +0000, olcott said:That sounds like Richard that assumed that incorrect answers are OKYou are asking for the definition of correct simulationThat was not my main intent. I wanted to know why your
that I have been providing for quite a while recently.
statement
exludes every unsimulated or incorrectly simulated D?No D simulated correctly by any H of every H/D pair specified
by the above template ever reaches its own line 06 and halts.
unless I specifically say that incorrect answers are not OK.
will sound the same.
On 5/19/2024 12:17 PM, Richard Damon wrote:If you mean that H cannot simulate D to the line 06 then say so.
> On 5/19/24 9:59 AM, olcott wrote:
>> Richard has stated that he thinks that an example of
>> {D never simulated by H} ∈ {every D simulated by H}
>
> No, the H that didn't simulate its input shows that
> *once you allow H to not be required to be correct*,
> that we can then have a trivial function that is
> "just as correct" (since wrong answers were allowed).
It means that 1 to N instructions of D are correctly simulatedA c function is correctly simulated when its machine languageDoes "its machine language instructions" mean all executed instructions
instructions are emulated with an x86 emulator in the order
that they are specified by the x86 machine language of this
c function.
until the progam terminates? Or from the start of the program until
there is no reason to continue? Or from some point to some other point?
by pure function H. Because D correctly simulated by H remains
stuck in recursive simulation D cannot possibly reach is own
line 06 and halt.
A D that is simulated by H is D and so is a D that is not simulated
by H so both can do what a D can do. Saying "simulated by H" adds
nothing.
If you think that the meaning of "correctly simulate" is notWhen 1 to 2^64 instructions of D are correctly simulated by HFor non-terminating functions we can only correctlyBut does you definition regard that partial simulation as "correct
simulate N machine language instructions.
simulation"?
it becomes clear that for every H/D pair of the infinite set
of H/D pairs D correctly simulated by H remains stuck in recursive
simulation.
important you should not use those words.
is assumed.
We have been going over the term "correct simulation"That alone is a sufficient reaston to avoid the expression.
in these forums with dozens of people and hundreds of messages
over several years.
CORRECT SIMULATION DEFINEDThat is not a definition but perhaps a suffient substitute for paractical
In the above case a simulator is an x86 emulator that correctly
emulates at least one of the x86 instructions of D in the order
specified by the x86 instructions of D.
This may include correctly emulating the x86 instructions of H in the
order specified by the x86 instructions of H thus calling H(D,D) in
recursive simulation.
purposes.
refute each and every reviewer that tries to get away with
the incorrect emulation of the x86 instructions of H or D or
emulating them in the wrong order.
Les messages affichés proviennent d'usenet.