Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| Subject | Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] |
|---|---|
| Newsgroups | comp.theory |
| References | (19 earlier) <o6SdnYYJuvqG1Q39nZ2dnUU7-IvNnZ2d@giganews.com> <P4YjI.24922$zx1.9827@fx20.iad> <Ec6dnXIC1JZSwgz9nZ2dnUU7-X3NnZ2d@giganews.com> <RDdkI.174690$N_4.168228@fx36.iad> <cN-dnQ66K5659Qz9nZ2dnUU7-cvNnZ2d@giganews.com> |
| From | Richard Damon <Richard@Damon-Family.org> |
| Message-ID | <OVdkI.220391$J_5.157907@fx46.iad> (permalink) |
| Organization | Forte - www.forteinc.com |
| Date | 2021-05-04 11:40 -0400 |
On 5/4/21 11:28 AM, olcott wrote: > On 5/4/2021 10:21 AM, Richard Damon wrote: >> On 5/4/21 10:53 AM, olcott wrote: >>> On 5/3/2021 2:23 PM, Richard Damon wrote: >>>> On 5/3/21 3:00 PM, olcott wrote: >>>>> On 5/3/2021 11:23 AM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 5/2/2021 6:52 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 5/2/2021 3:38 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> On 5/1/2021 9:30 PM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>> >>>>>>>>>>>>> On 5/1/2021 8:20 PM, Ben Bacarisse wrote: >>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>> >>>>>>>>>>>>>>> On 5/1/2021 7:51 PM, Ben Bacarisse wrote: >>>>>>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>>> No H_Hat() in the universe ever stops running unless its >>>>>>>>>>>>>>>>> otherwise >>>>>>>>>>>>>>>>> infinite recursion is aborted at some point. >>>>>>>>>>>>>>>> >>>>>>>>>>>>>>>> This is just a silly word game. What a computation >>>>>>>>>>>>>>>> would do >>>>>>>>>>>>>>>> "otherwise" >>>>>>>>>>>>>>>> is irrelevant. H_Hat(H_Hat) is finite and it does not >>>>>>>>>>>>>>>> matter how or >>>>>>>>>>>>>>>> why. It is a finite computation, and should be reported as >>>>>>>>>>>>>>>> such. >>>>>>>>>>>>>>> >>>>>>>>>>>>>>> So in other words you believe that it is ridiculous for >>>>>>>>>>>>>>> anyone to ever >>>>>>>>>>>>>>> consider defining a partial halt decider because everyone >>>>>>>>>>>>>>> agrees that >>>>>>>>>>>>>>> is cannot be done perfectly so why bother doing this at all. >>>>>>>>>>>>>> >>>>>>>>>>>>>> No. I am saying that your wording is silly because it >>>>>>>>>>>>>> attempts to >>>>>>>>>>>>>> justify the wrong answer using another, different, >>>>>>>>>>>>>> computation. >>>>>>>>>>>>>> H_Hat(H_Hat) is finite. >>>>>>>>>>>> >>>>>>>>>>>> I see you don't dispute these facts. >>>>>>>>>> >>>>>>>>>> Good to see these facts confirmed by you once again. If you >>>>>>>>>> dispute >>>>>>>>>> that you justify giving the wrong answer using another related >>>>>>>>>> computation, all you need to do is say so (and correct the record >>>>>>>>>> where >>>>>>>>>> you say that Halts(H_Hat, H_Hat) is false, but the arguments to >>>>>>>>>> Halts >>>>>>>>>> denote a finite computation). >>>>>>>> >>>>>>>> I think we can safely assume that you do not want to dispute any of >>>>>>>> these facts. >>>>>> >>>>>> All the smoke you are trying to blow below can not detract from this >>>>>> end >>>>>> result. You are stupidly trying to get away with the wrong answer. >>>>>> >>>>>>>>>>>>> The above criteria does correctly decide infinite recursion. >>>>>>>>>>>> >>>>>>>>>>>> What has this got to do with the computation H_Hat(H_Hat) (the >>>>>>>>>>>> real one, >>>>>>>>>>>> not the one you posted recently to poison the well)? It >>>>>>>>>>>> calls no >>>>>>>>>>>> functions that call H_Hat. In the world of C and x86 code, >>>>>>>>>>>> that >>>>>>>>>>>> means >>>>>>>>>>>> it is not recursive at all. >>>>>>>>>> >>>>>>>>>>>> You ignored the key facts I put to you. These were facts that >>>>>>>>>>>> you told >>>>>>>>>>>> me so you are stuck with them until you correct the record. >>>>>>>>>>> >>>>>>>>>>> The key fact is that every time H_Hat() calls Halts() it >>>>>>>>>>> meets the >>>>>>>>>>> above criteria of infinite recursion, you can dodge this fact >>>>>>>>>>> but >>>>>>>>>>> you >>>>>>>>>>> cannot correctly refute this fact. >>>>>>>>>> >>>>>>>>>> I am not dodging it -- I am telling you it's a lie. >>>>>>>>> >>>>>>>>> You can even tell me that it is a lie, what you cannot do is prove >>>>>>>>> that it is false. >>>>>>>> >>>>>>>> I don't know what that means. I take what you say about the >>>>>>>> trace at >>>>>>>> face value because I don't want to look at it without knowing >>>>>>>> what's >>>>>>>> being traced. You appear to be suggesting that the trace shows >>>>>>>> recursive calls where there should be none. I am happy to be >>>>>>>> corrected >>>>>>>> on this point. Does the trace show infinite nested simulations >>>>>>>> instead? >>>>>>> >>>>>>> Since the halt deciding criteria that matches infinite recursion is >>>>>>> exactly the same as the criteria that matches infinite nested >>>>>>> simulations and infinite nested simulations are computationally >>>>>>> equivalent to infinite recursion I can them both infinite recursion. >>>>>> >>>>>> I /think/ this means that you now know you used the wrong words >>>>>> but you >>>>>> were not trying to mislead anyone. Is that about it? >>>>> >>>>> I always speak in terms of the essential gist of things not paying >>>>> attention to the microscopic details. >>>>> >>>>> Because it is ridiculously obvious that infinitely nested >>>>> simulation has >>>>> computationally identical halting behavior to infinite recursion and >>>>> both non halting behavior patterns are identical and the halt decider >>>>> does not care and does not know the difference I named the single >>>>> dynamic behavior pattern the [infinite recursion] dynamic behavior >>>>> pattern. >>>> >>>> The issue is you ignore some 'detail' that actually IS important. >>>> >>>> Like the fact that the subroutine 'Halts' when called by H_Hat is PART >>>> OF H_HAT, and that its decision to stop simulating the input it was >>>> given does NOT make H_Hat an 'infinite recursion' >>> >>> >>> An infinite loop is correctly decided to specify non halting behavior on >>> the basis that it matches the [infinite loop] dynamic behavior pattern. >>> The fact that it does halt because the halt decider forced it to halt >>> does not change this. >>> >>> The fact that H_Hat() always matches the [infinite recursion]** dynamic >>> behavior pattern (when it is executed with itself as input) is what >>> makes the halt decider's decision correct. The fact that it does halt >>> because the halt decider forced it to halt does not change this. >>> >>> ** Also applies to infinitely nested simulations. >>> >> >> If you say H_Hat matches your infinite recursion pattern, your pattern >> is WRONG. This is a rule you are making up yourself, so has no proof of >> being correct. > > If the execution trace of function Y() shows: > function X() is called twice in sequence from the same machine address > of Y() > with the same parameters to X() > with no conditional branch or indexed jump instructions in Y() > with no function call returns from X() > then the function call from Y() to X() is infinitely recursive. > > You won't be able to show any error because the above is correct. > > This same dynamic behavior pattern also correctly recognizes infinitely > nested simulations. > BAD RULE. As I have said, that fact that X is called from Y means that the decision in X are part of the Computation of Y. If X really is a Compuation, the it will always do the same thing, and thus calling X itself won't return so it can't be a decider. In this case, X ISN'T Really a function, but is a simualtion hook, so the whole arguement by comparison is flawed Since you ignored this proof: 1) Halts is stipulated to meet the requirements of a Halt Decider for Computation Theory, as used in the proof of Linz and Sipser. 2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when asked directly. 3) H_Hat is stipulated to be built like Linz or Sipser, in that it will halt when the Halt decider it is built on decides H_Hat’s input is non-Halting on itself. 4) 1 Means that Halts is a Computation, and will always return the same answer (or never return an answer) for a given input. 5) H_Hat(H_Hat) when run as a Machine will perform the Computation Halts(H_Hat, H_Hat) 6) by 4 and 2, this means that Halts will return the decision on non-halting to H_Hat 7) By 3, this means that H_Hat will Halt. I presume that means that you don't see an error in it and are just continuing to ramble incoherently trying to prove something that is false. I won't comment further on the Y/X rule in some other setting, because frankly it doesn't apply here and is just a starwman. Halts is WRONG about H_Hat. Face it. You logic system is bogus, a failure, garbage.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 11:30 -0500
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 11:37 -0500
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 12:40 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 14:55 -0400
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 14:09 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-01 22:42 +0100
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 17:32 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 18:43 -0400
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 18:16 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 21:20 -0400
Re: Mutual agreement on the definition of a [computation] in computer science Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-02 00:49 +0100
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 18:02 -0400
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 17:49 -0500
Re: Mutual agreement on the definition of a [computation] in computer science André G. Isaak <agisaak@gm.invalid> - 2021-05-01 17:28 -0600
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-01 18:42 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 01:51 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-01 20:05 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 02:20 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-01 20:42 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-01 22:10 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 03:30 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-01 23:36 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 07:51 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 21:38 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 17:11 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-03 00:53 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-02 19:45 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 20:56 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 20:55 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-03 13:43 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-03 09:06 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 10:34 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 00:58 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:12 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 21:57 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Jeff Barnett <jbb@notatt.com> - 2021-05-03 11:39 -0600
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-02 17:41 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-03 00:52 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-02 19:34 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 20:49 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-03 17:23 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-03 14:00 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-03 15:23 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 09:53 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 11:21 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:28 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 11:40 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 17:11 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 11:23 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 12:40 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 11:46 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 13:17 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 21:47 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 17:31 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 23:21 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 00:49 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:09 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:45 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 19:50 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:04 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 11:22 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:31 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-04 11:46 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-04 19:56 +0100
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 20:44 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] André G. Isaak <agisaak@gm.invalid> - 2021-05-01 21:14 -0600
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-02 00:04 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] André G. Isaak <agisaak@gm.invalid> - 2021-05-01 23:27 -0600
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] olcott <NoOne@NoWhere.com> - 2021-05-02 12:47 -0500
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-02 14:38 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-01 21:40 -0400
Re: Mutual agreement on the definition of a [computation] in computer science [ H_Hat() ALWAYS specifies infinite recursion that must be aborted ] Richard Damon <Richard@Damon-Family.org> - 2021-05-01 21:35 -0400
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 21:29 -0400
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 14:49 -0400
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 14:02 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-01 22:50 +0100
Re: Mutual agreement on the definition of a [computation] in computer science Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-01 18:22 +0000
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 13:35 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-01 22:39 +0100
Re: Mutual agreement on the definition of a [computation] in computer science Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-01 22:49 +0100
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 18:35 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 01:56 +0100
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 20:22 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-01 21:45 -0400
Re: Mutual agreement on the definition of a [computation] in computer science Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 02:53 +0100
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-01 23:55 -0500
Re: Mutual agreement on the definition of a [computation] in computer science André G. Isaak <agisaak@gm.invalid> - 2021-05-01 23:07 -0600
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-02 08:10 -0400
Re: Mutual agreement on the definition of a [computation] in computer science Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 20:29 +0100
Re: Mutual agreement on the definition of a [computation] in computer science olcott <NoOne@NoWhere.com> - 2021-05-02 14:34 -0500
Re: Mutual agreement on the definition of a [computation] in computer science Richard Damon <Richard@Damon-Family.org> - 2021-05-02 15:48 -0400
Re: Mutual agreement on the definition of a [computation] in computer science Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-02 21:46 +0100
csiph-web