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 | (12 earlier) <pYudncz-SKL2nhP9nZ2dnUU7-f3NnZ2d@giganews.com> <s6l5ei$il3$1@dont-email.me> <f9adncB8zpRKrxP9nZ2dnUU7-I3NnZ2d@giganews.com> <s6ld88$lr6$1@dont-email.me> <i8-dnYJ5wYsweBP9nZ2dnUU7-SHNnZ2d@giganews.com> |
| From | Richard Damon <Richard@Damon-Family.org> |
| Message-ID | <okCjI.23562$ft1.12865@fx10.iad> (permalink) |
| Organization | Forte - www.forteinc.com |
| Date | 2021-05-02 14:38 -0400 |
On 5/2/21 1:47 PM, olcott wrote: > On 5/2/2021 12:27 AM, André G. Isaak wrote: >> On 2021-05-01 23:04, olcott wrote: >>> On 5/1/2021 10:14 PM, André G. Isaak wrote: >>>> On 2021-05-01 19:42, olcott wrote: >>>>> 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. >>>>> >>>>> If the execution trace of function X() called by function Y() shows: >>>>> (1) Function X() is called twice in sequence from the same machine >>>>> address of Y(). >>>> >>> >>> If the execution trace of function H_Hat() calling function Halts() >>> shows: >>> (1) Function Halts() is called twice in sequence from the same >>> machine address of H_Hat(). >> >> But Halts() is *emulating* H_Hat. That means that the 'call' to Halts >> inside H_Hat is also being emulated. It isn't an actual call. >> > > It is computationally equivalent to a call. Error of category. Computationally Equivalence is a property of Full Computatons, not individual machine instructions. > >> So how does Halts() determine that the routine which it is emulating >> inside H_Hat is a call to Halts() as opposed to something else? >> > > It can do this on the basis of the machine address ranges. > It does not need to know this, it only needs to know that the infinite > recursion criteria has been met. The issue is that first this test doesn't have meaning when you think about converting to a Turing Equivalent, and can only be done because you didn't fully form H_Hat correctly. H_Hat, by its definition of formation includes its own copy of ALL the code it uses, including Halts. If fact, because we pass it a representation of a machine, that machine needs to be a totally independent 'program', which DEFINITELY can not call back to subroutines within the original simulator. Once you change your program to do this, your 'machine address range' test just fails. This goes back to you definitions. You have 'defined' that Halts is supposed to be deciding based on providing it a COFF file, but Halts does not actually take a COFF file as its input, but addresses in its own program space. This makes H_Hat and Halts to not be in the relationship they need to be inorder to really be the equivalents of the needed Turing Machine. It turns out, as long as you still keep to the real definition of Halting and Computations, this error isn't enough let you cheat the proof through, but it does get you close enough that this bogus recursion definition can almost sound convinsing for a Rhetorical Argument. By pulling the code for Halts out of H_Hat, you can try to argue that the decision of the copy of Halts that was called by H_Hat isn't really part of the execution of H_Hat, but it really is. The fact that the Halts that is execution within the context of H_Hat is deciding to stop its simulation of the provided copy of H_Hat, doesn't make H_Hat 'infinittelly recursive' but actually is part of the reason it is finite. It is exactly the same reasoning that for(int i = 0; i < 5; i++) continue; is a finite loop, a decision, WITHIN the loop or within the execution of H_Hat (in the code of Halts that H_Hat called) made the decision to terminate and thus the loop ended. Ultimately, the answer of H_Hat being halting or non-halting is shown by actually running it, and as been show, it DOES halt. YOU try to mislead by saying it is only halting because Halts stopped it, which in one sense is true, but the Halts that stopped it was the Halts that was PART of H_Hat. It doesn't matter that the simulation seemed to have only stopped because the Halts running the simulation needed to make the decision, that is a limitation of how you have setup your simulator. The real test is what does the actual machine do. We CAN also show that Halts didn't need to stop the simulation, by changing the outer Halts, and ONLY the outer Halts, to be a pure simulator and not a halt decider. You try to argue that if we make this change we need to change all copies of Halts, but that is incorrect, that would change the definition of the program under test, which isn't allowed. Remember, H_Hat was defined to be built on a specific algrorithm with at the time it was created was the thing called Halts. It isn't defined to use whatever is called Halts, the name doesn't matter, it is to use the algorithm of the decider that it is supposed to foil. That is why it takes a copy. Not making the copy breaks the needed relationship between H_Hat and Halts. > >> In the past you've said that you do this based on addresses, but an >> emulator should have an entirely separate (emulated) address space >> from code which is actually being executed. > > There is no actual need for this. The key element of the emulation is > that the emulated execution of each instruction <is> a part of a single > computation and the emulator is free to stop its emulation as soon as > non-halting behavior criteria is met. > >> Furthermore, you've said your machine descriptions are in COFF files. >> A COFF file doesn't indicate *where* in memory a particular piece of >> code should be placed. So how > > I just leave code where it already is in the COFF file. > > // This file reads a Microsoft COFF Object file and patches > // all the otherwise relocatable data address references to > // their actual physical file offsets. > >> does the emulator decide that a particular piece of code should be >> given the same (emulated) address as the (actual) address of Halts()? >> > > The executing x86 code knows nothing about names, it only deals with > machine addresses. Every function has its own unique machine address as > an offset in the COFF object file. > >> André >> >>> (2) With the same parameters to Halts(). >>> (3) With no conditional branch or indexed jump instructions in H_Hat(). >>> (4) With no function call returns from Halts(). >>> then the function call from H_Hat() to Halts() is infinitely recursive. >>> >>> >>> _H_Hat() >>> [00000adb](01) 55 push ebp >>> [00000adc](02) 8bec mov ebp,esp >>> [00000ade](01) 51 push ecx >>> [00000adf](03) 8b4508 mov eax,[ebp+08] >>> [00000ae2](01) 50 push eax >>> [00000ae3](03) 8b4d08 mov ecx,[ebp+08] >>> [00000ae6](01) 51 push ecx > > This is where Halts() is called with the machine address of H_Hat() > having been pushed onto the stack in the prior two push instructions. > >>> [00000ae7](05) e85ffeffff call 0000094b >>> [00000aec](03) 83c408 add esp,+08 >>> [00000aef](03) 8945fc mov [ebp-04],eax >>> [00000af2](02) 8be5 mov esp,ebp >>> [00000af4](01) 5d pop ebp >>> [00000af5](01) c3 ret >>> Size in bytes:(0027) [00000af5] >>> >>> Begin Local Halt Decider Simulation at Machine Address:adb >>> ...[00000adb][0021158c][00211590](01) 55 push ebp >>> ...[00000adc][0021158c][00211590](02) 8bec mov >>> ebp,esp >>> ...[00000ade][00211588][0020155c](01) 51 push ecx >>> ...[00000adf][00211588][0020155c](03) 8b4508 mov >>> eax,[ebp+08] >>> ...[00000ae2][00211584][00000adb](01) 50 push eax >>> ...[00000ae3][00211584][00000adb](03) 8b4d08 mov >>> ecx,[ebp+08] >>> ...[00000ae6][00211580][00000adb](01) 51 push ecx >>> ...[00000ae7][0021157c][00000aec](05) e85ffeffff call >>> 0000094b >>> ...[00000adb][0025bfb4][0025bfb8](01) 55 push ebp >>> ...[00000adc][0025bfb4][0025bfb8](02) 8bec mov >>> ebp,esp >>> ...[00000ade][0025bfb0][0024bf84](01) 51 push ecx >>> ...[00000adf][0025bfb0][0024bf84](03) 8b4508 mov >>> eax,[ebp+08] >>> ...[00000ae2][0025bfac][00000adb](01) 50 push eax >>> ...[00000ae3][0025bfac][00000adb](03) 8b4d08 mov >>> ecx,[ebp+08] >>> ...[00000ae6][0025bfa8][00000adb](01) 51 push ecx >>> ...[00000ae7][0025bfa4][00000aec](05) e85ffeffff call >>> 0000094b >>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped >>> >>> >>>> This part you really need to elaborate on. H_Hat(X) calls Halts(X, >>>> X), which then emulates X(X) based on the description of X which it >>>> has been passed. How does Halts determine whether that X describes >>>> 'the same' function as one previously called? i.e. how does it >>>> figure out that X is a description of H_Hat? >>>> >>>> André >>>> >>>>> (2) With the same parameters to X(). >>>>> (3) With no conditional branch or indexed jump instructions in Y(). >>>>> (4) With no function call returns from X(). >>>>> then the function call from Y() to X() is infinitely recursive. >>>>> >>>>> The above criteria does correctly decide infinite recursion. >>>>> The above criteria does correctly decide infinite recursion. >>>>> The above criteria does correctly decide infinite recursion. >>>>> >>>>> Every call from H_Hat() to Halts() meets this criteria. >>>>> Every call from H_Hat() to Halts() meets this criteria. >>>>> Every call from H_Hat() to Halts() meets this criteria. >>>>> >>>>> Ignoring this key fact is no form of correct rebuttal. >>>>> Ignoring this key fact is no form of correct rebuttal. >>>>> Ignoring this key fact is no form of correct rebuttal. >>>>> >>>>>> Halts(H_Hat, H_Hat) should be true, but you >>>>>> have written Halts so that it's false and you justify that wrong >>>>>> answer >>>>>> by what would happen were things not as they are. It's flagrant >>>>>> silliness. >>>>> >>>>>> When you find yourself starting off "So in other words you >>>>>> believe..." >>>>>> you should stop and ask yourself, "what point am I trying to avoid by >>>>>> putting words into my interlocutor's mount?". >>>>>> >>>>> >>>>> >>>> >>>> >>> >>> >> >> > >
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