Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | comp.theory |
| Subject | Re: Infinitely Recursive input on HP Proofs |
| Date | 2017-03-20 18:07 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <87d1dbq0so.fsf@bsb.me.uk> (permalink) |
| References | (12 earlier) <b558a8ed-fbab-4faa-90a3-fba6e6b7442a@googlegroups.com> <8760j6tx5x.fsf@bsb.me.uk> <8c8c186b-71e6-4f82-bd27-8390f7a6a96e@googlegroups.com> <87mvcis1xg.fsf@bsb.me.uk> <6181c73b-b443-4df8-a371-7960809d57aa@googlegroups.com> |
peteolcott <peterolcott2@gmail.com> writes:
> On Saturday, March 18, 2017 at 4:35:57 PM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>>
>> > On Saturday, March 18, 2017 at 10:35:57 AM UTC-5, Ben Bacarisse wrote:
>> >> peteolcott <peterolcott> writes:
>> >>
>> >> > On Friday, March 17, 2017 at 8:39:09 PM UTC-5, Ben Bacarisse wrote:
>> >> <snip>
>> >> > I am calling Linz's description of H^ state transition matrix source
>> >> > code, this would be obvious to anyone that understood state transition
>> >> > matrices.
>> >>
>> >> Of course it's obvious -- it's just wrong. Source code is not the right
>> >> way to refer to states and state transitions. It's not even the right
>> >> way to refer to an encoded TM. If you want to be understood, use the
>> >> right words.
>> >
>> > A Turing Machine Description IS the source code of a Turing Machine.
>> > (as George Greene of sci.logic would say: you idiot).
>> >
>> >>
>> >> > +++ q0 Wm |-* H^ qc Wm Wm |-* H^ qy ∞
>> >> > +++ q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2
>> >> >
>> >> > The last time that I told you this I did it by direct quotes that you
>> >> > must have ignored or I would not have to say this all again.
>> >> >
>> >> > I will describe it step by (I think I already did this once)
>> >> > q0 // H^ start state
>> >> > Wm // Input to H^
>> >> > |-* // an arbitrary number of state transitions that copy Wm
>> >> > H^ qc Wm Wm // H^ has copied its input and is beginning to analyze WmWm
>> >>
>> >> That's saying more than you know. All you know is that H^ now "behaves
>> >> exactly like H'".
>> >
>> > I call bullshit.
>>
>> I call not understanding.
>>
>> > If H^ behaved EXACTLY like H' then it would not copy its input.
>>
>> Did you miss the word "now"?
>>
>> > Try
>> > and use your words with (as much as possible) 100% perfect
>> > precision. I already called you on this before when you referred to a
>> > true opinion, (contradiction in terms).
>>
>> They are Linz's words not mine; that's why I put them in quotes. H^
>> copies it's input an *then* behaves exactly like H'. It's not hard to
>> understand.
>
> You and Linz are both incorrect on this.
Not so. It is so by definition.
> If either you or Linz would have studied Linz's clearest possible
> specification until you grokked it you would both have the same new
> insight that I have.
There is no point in drawing silly conclusions form an error in the
text. If you can't see past it, try any of a hundred other proofs of
this theorem. They all use the same definition that you are denying to
Linz -- a machine copies its input and then behaves as the machine it is
derived from.
>
> It is, however, so very much easier to simply understand these things in the conventional way. Also what would be your basis for even suspecting that the conventional understanding is incorrect?
>
> All of these years I have only had an intuition that the conventional understanding of the halting problem and the incompleteness problem are incorrect.
>
> My basis for this intuition it that the 2000 year old Liar Paradox
> continued to lack any conventional understanding what-so-ever. Everyone knew that something was wrong yet no one knew exactly what was wrong.
>
> I also knew intuitively that all three of these HP, IT, and LP had pathological self reference as the source of their error. I said that here in this forum several years ago.
>
> It was not until about a year ago that I could state this intuition in a way that could be eventually mathematically verified. If the Incompleteness Theorem is correct then it proves that sometimes logical entailment either fails to complete or derives contradictory results. I have known that this is not possible because logical entailment is entirely based on logical tautology.
>
> You probably don't understand the mathematical meaning of those words and won't bother to look them up.
>
> This link anchors the concept of logical entailment:
> https://en.wikipedia.org/wiki/Logical_consequence#Proofs_and_models
>
>>
>> Unfortunately you rejected my formal explanation using state names but
>> you offered not better alternative. I see no option but to quote Linz's
>> words and hope that the penny drops. You are obviously averse to asking
>> for help, but if you don't say what part of his proof is confusing you,
>> I can't help much more than that.
>
> I did not reject state names. I said that Linz goofed when he resumed
> the execution of H^ back to its start state after it copied its
> input.
So fix it and more on. None of your re-writes have been clear in how
the problem should be fixed because, of course, you don't want to fix
it. You thought that H^ machine endlessly copied it's input and you
don't like that fact that that error is trivial to correct. You'd be
stuck having to accept the theorem again as you did for so many years.
>
>>
>> You can't criticise the proof until you've understood it, and you seemed
>> genuinely surprised ("I call bullshit") by my direct quote of Linz words
>> about H^ copying its input and then behaving like H'. That suggests to
>> me that you don't know what Linz is saying.
>
> No it means that I ignore some of his mistakes and correct
> others. Because H^ has an infinitely recursive structure and H' does
> not have infinitely recursive structure there is not point where H^
> behaves like H'.
Of course you don't want to correct the poof so you pick and choose what
you call the error. That shows only a lack of intellectual backbone.
Fix the error in the proof so the proof is correct. Anything else is
just burying your head in the sand.
<snip>
>> >> If you were a student of mine, I'd make it very concrete. I'd give you
>> >> an actual machine H and ask you do write down H' and then H^. Then I'd
>> >> ask you to run through the execution of H^. Have you done that? Do
>> >> think you could do that?
>> >
>> > I have two patents as sole inventor of two finite state machines what
>> > would you guess?
>>
>> Since you are avoiding the question, I would guess that you think you
>> can't do it, but it's not hard and I'm pretty sure you could. I'll
>> start you off. Here's an example H.
>>
>> H = ({a,b}, {1,0}, {1,0,_}, d, a, _, {b})
>>
>> with d(a,1) = (a,1,R), d(a,0) = (a,0,R) and d(a,_) = (b,_,L). What are
>> H' and H^?
>>
>
> Since you changed the Linz notational conventions and and did not
> define your differing notational conventions I have no idea what you
> are saying.
This is Linz's notation. You are confusing how he write execution
configurations with how he defines machines. The explanation of the
notation for a machine is a few chapter earlier on (you have read the
book, yes?).
He defines a Turing machine an ordered 7-tuple so there can be no doubt
what H = ({a,b}, {1,0}, {1,0,_}, d, a, _, {b}) means. All the sets and
functions are clearly specified. Only the details of the d function
remain to written out (it would be unreadable if it were specified as a
set in the tuple) and I did that.
Anyway, as I said, I am sure that you can do this so just ask if
something is confusing you. Which part of this machine description is
bothering you?
>> (For convenience I'm using Linz's formalism here so Q={a,b}, Sigma={1,0}
>> and so on. If it's not clear, just ask.)
>
> That differs too much from Linz, stick with the convention of
> preceding every state with a q such as q0.
No, if you can't cope with a two-state machine with names of my choosing
you need to go back to square one. Especially as the crucial problem
involves exactly the problem of confusing that start state of two
machines one derived from the other. Using q0 for both is exactly the
problem you need to get round.
You sell yourself short if you think you can't cope with a machine with
two states called a and b. I'm sure you can.
(I'm discounting the possibility that your deliberately want to use q0
for every start state so that you can try avoid correcting Linz's
mistake. That would be disingenuous in the extreme so I will reject
that explanation for now.)
> This is better notation because it explicitly:
<re-ordered a bit: here's the notation:>
> q0 Wm W |-* H x1 qy x2
> q0 Wm W |-* H y1 qn y2
>
> (a) Names every state in state transition order.
No it doesn't. Do you really not know what the notation means? It's
about machine configurations.
> (b) Shows how many inputs
No it does not. All TM's have a possibly blank tape to start with.
There is no number of inputs -- only some set of input symbols. Again,
you seem not to know what qx a b c |-* H ... means.
> (c) Shows the final tape configuration (this is not very useful)
Actually it's crucial to the proof, but since this notation is not about
defining a machine, it does not apply here.
> (d) Indicates an arbitrary number of unspecified state transitions
> thus abstracts out unnecessary details.
Ah, yes, that would indeed help you. What I asked for was an actual H'
and H^ derived from an actual H. This would show that you are wrong, so
you must at all costs never do anything that clear and concrete. Keep
it as abstract and as far away from a counterexample as possible!
Anyway, if you really think you can't write out H' and H^ from my
example H, just say so, and I'll do it for you.
<snip>
--
Ben.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-11 13:13 -0800
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-12 11:25 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-12 10:58 -0700
Re: Infinitely Recursive input on HP Proofs Kaz Kylheku <336-986-7787@kylheku.com> - 2017-03-12 19:34 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-13 07:23 -0700
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 08:46 -0700
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 12:17 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-15 20:40 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 14:01 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 14:09 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-16 09:53 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 21:54 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-17 07:09 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 01:39 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-18 05:40 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 15:35 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-18 12:52 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 21:35 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-20 07:16 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-20 18:07 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-21 05:03 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-21 19:47 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-22 05:35 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-22 16:41 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-23 06:24 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-25 01:11 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-25 08:09 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-25 21:58 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-27 06:18 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-27 22:20 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-28 15:33 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-29 01:29 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-25 19:57 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-26 23:53 +0100
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-13 03:14 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-13 07:23 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-15 17:12 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 13:56 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 03:23 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 21:22 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 10:19 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-16 09:26 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 22:00 +0000
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-17 07:17 -0700
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-28 10:20 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-29 01:18 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-29 10:09 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-01 02:55 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-01 05:30 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-02 00:50 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-01 19:10 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-02 03:19 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-03 06:28 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-04 01:27 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-09 21:41 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-10 14:35 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-10 13:58 -0700
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-11 00:58 +0100
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2017-04-10 20:29 -0500
Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-29 14:29 -0500
Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-29 14:45 -0500
Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-30 13:23 -0500
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-30 23:05 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-30 18:43 -0500
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-05-01 13:45 +0100
Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-30 13:24 -0500
Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2017-04-27 21:16 +0100
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-26 11:37 -0600
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:14 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 21:57 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:10 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:51 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 00:38 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 13:37 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 14:27 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 23:49 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:27 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 02:13 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:15 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:13 +0000
Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 21:30 +0000
Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:17 +0000
Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:42 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-08 18:44 -0600
Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-09 11:08 +0000
Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-11 17:55 +0000
Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:39 -0600
Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-25 19:56 -0700
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 00:18 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 13:06 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 16:55 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 00:30 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 19:38 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 02:27 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Andy Walker <anw@cuboid.co.uk> - 2018-02-14 22:55 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 17:22 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 21:00 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-15 21:38 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 17:27 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 17:34 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 00:15 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 18:43 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 01:05 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 19:37 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 02:34 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 20:51 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 03:32 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 22:42 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 12:06 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-16 10:26 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 20:42 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-16 17:48 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-17 01:33 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-19 15:48 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) David Kleinecke <dkleinecke@gmail.com> - 2018-02-22 12:40 -0800
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-22 15:31 -0600
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Andy Walker <anw@cuboid.co.uk> - 2018-02-15 12:24 +0000
Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 12:25 -0600
csiph-web