Liste des Groupes | Revenir à c theory |
On 10/15/2024 9:12 PM, Richard Damon wrote:Right, which it does.On 10/15/24 3:56 PM, olcott wrote:When we use an industry standard definition of the terminationOn 10/15/2024 2:29 PM, joes wrote:>Am Tue, 15 Oct 2024 14:18:52 -0500 schrieb olcott:>On 10/15/2024 10:32 AM, joes wrote:What is the same?Am Tue, 15 Oct 2024 07:33:47 -0500 schrieb olcott:It is the same as verifying that a conclusion logically follows form itsOn 10/15/2024 3:54 AM, Mikko wrote:Stipulative definitions can also not be correct. Correctness is simplyOn 2024-10-14 16:05:20 +0000, olcott said:If X cannot be incorrect then disagreeing that X is correct is
>A stipulative definition is a type of definition in which a new orThe Wikipedia page does not say that. It only says that a stipulative
currently existing term is given a new specific meaning for the
purposes of argument or discussion in a given context. *Disagreeing
with a stipulative definition is incorrect*
definition itself cannot be correct.
incorrect.
out of scope. It can be rejected though. Is your best defense really
"it has no truth value"?
premises when hypothesizing that the premises are true.
>Meaning, DDD is terminating function, because it reaches its return,???And not a function that can't be simulated by HHH.The article also says that the scope of a stipulative definition isOnce a stipulated definition is provided by its author it continues to
restricted to an argument or discussion in given context.
apply to every use of this term when properly qualified.
A *non_terminating_C_function* is C a function that cannot possibly
reach its own "return" instruction (final state) thus never
terminates.
even though HHH can't simulate the call to itself (because a simulator
terminates only when its input does, so it can't halt simulating itself).
>
In other words you insist on failing to understand
that the behavior of DDD after HHH aborts its emulation
is different than the behavior that requires HHH to
abort its emulation.
>>A full emulation of a non-terminating input is logically impossible. DoA *correct_x86_emulation* of non-terminating inputs includes at leastThis qualifies only as a partial simulation. A correct simulation may
N steps of *correct_x86_emulation*.
not terminate.
you not know this?Of course. The simulation does not terminate.>
>
Then you don't understand that the emulation of DDD
by HHH does not reach its own "return" instruction
BECAUSE DDD calld HHH in recursive emulation?
>>What else interesting is there about this?Where in my stipulated definitions did I ever refer to a decider?DDD *correctly_emulated_by* HHH refers to a *correct_x86_emulation*.And HHH is not a decider.
This also adds that HHH is emulating itself emulating DDD at least
once.
When HHH is an x86 emulation based termination analyzer then each DDD
*correctly_emulated_by* any HHH that it calls never returns.
>
Termination analyzer is the term that I have been
using for many months.
>
And using incorrectly.
>
of a C function we understand that this C function must reach
its "return instruction".
Likewise the industry standard for correct x86 emulation meansTo their end, at least if you want to use it to determine the final behavior of something.
emulating the instructions of any input according to the semantics
of the x86 language.
Les messages affichés proviennent d'usenet.