Liste des Groupes | Revenir à c theory |
Am Tue, 15 Oct 2024 14:18:52 -0500 schrieb olcott:In other words you insist on failing to understandOn 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).
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
Termination analyzer is the term that I have beenWhat 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.
Vert unlikely because they do conform to software engineering andEach of the directly executed HHH emulator/analyzers that returns 0Aha! Your premises *can* be false.
correctly reports the above *non_terminating _behavior* of its input.
When evaluating the external truth of my stipulated definition
premises and thus the soundness of my reasoning
termination analysis standard definitions.
Just noting that your past dozen or so posts were useless and wrong.It seems dishonest of you yo refer to what I said in the past
At least everyone will know that you are using the strawman deception inone cannot change the subject away from the termination analysis of CNot happening. You are the one claiming to have implemented a halting
functions to the halt deciders of the theory of computation this too
is the strawman deception.
decider. Your work is related more to the HP than to the termination
analysis of general functions.
your rebuttal.
What even IS your claim at this point?void DDD()
Les messages affichés proviennent d'usenet.