Liste des Groupes | Revenir à theory |
Am Tue, 19 Nov 2024 08:44:17 -0600 schrieb olcott:I cannot afford to tolerate changing the subject to irrelevantOn 11/19/2024 5:56 AM, joes wrote:972440.pdfAm Mon, 18 Nov 2024 14:21:04 -0600 schrieb olcott:On 11/18/2024 1:23 PM, Richard Damon wrote:>On 11/18/24 2:07 PM, olcott wrote:On 11/18/2024 1:02 PM, Richard Damon wrote:On 11/18/24 1:41 PM, olcott wrote:On 11/18/2024 10:16 AM, Richard Damon wrote:On 11/17/24 11:04 PM, olcott wrote:On 11/17/2024 9:19 PM, Richard Damon wrote:On 11/17/24 9:47 PM, olcott wrote:On 11/17/2024 8:26 PM, Richard Damon wrote:On 11/17/24 8:46 PM, olcott wrote:On 11/17/2024 4:04 PM, Richard Damon wrote:On 11/17/24 4:30 PM, olcott wrote:On 11/17/2024 2:51 PM, Richard Damon wrote:On 11/17/24 1:36 PM, olcott wrote:You stupidly claimed termination analysis is only done onLook again at what they process. C functions that include allNo stupid I provided a published paper that includes theBut then you can talk about "emulation" or x86 semantics, asWhich is just what YOU are doing, as "Halting" and what aYET ANOTHER STUPID LIE.
"Program" is are DEFINED, and you can't change it.
A SMART LIAR WOULD NEVER SAY THAT I MEANT PROGRAM WHEN I
ALWAYS SPECIFIED A C FUNCTION.
both of those are operations done on PROGRAMS.
termination analysis of C functions.
the functions they call.
programs. I proved that you were stupidly wrong on pages 24-27
of the PDF of this paper.
Automated Termination Analysis of C Programs
https://publications.rwth-aachen.de/record/972440/files/Whatever. I was asking a different question. Furthermore, what happensThe ONLY thing that it relevantWhat happens when we run HHH(HHH)?Since the halting problem is defined to have the input call its ownThose *ARE* "Computation Theory" Programs.The top of PDF page 24 are not programs defection for brains.Termination analysis applies to FUNCTIONS, FULL FUNCTIONS, onesThe problem here is you are mixing language between domains.I said the termination analysis applies to C functions you said
that it does not. No weasel words around it YOU WERE WRONG!
that include everything that is part of them. Those things, in
computation theory, are called PROGRAMS.
https://publications.rwth-aachen.de/record/972440/files/972440.pdf
They are also LEAF functions, unlike your DDD.
NOTHING in that paper (form what I can see) talks about handling non-
leaf-functions with including all the code in the routines it calls.
termination analyzer and the termination analyzer is itself required
to halt then any sequence of this input that would prevent it from
halting IS A NON-HALTING SEQUENCE THAT MUST BE ABORTED AND CANNOT BE
ALLOWED TO CONTINUE.
when we run HHH1(DDD), HHH1(DDD1), HHH(DDD1)?
DDD emulated by HHH1 DOES NOT SPECIFY THAT HHH1 must emulate itself
emulating DDD.
Of course not. DDD specifies to call HHH, regardless of the simulator.Everyone here has been trying to dishonestly pretend that the
Les messages affichés proviennent d'usenet.