Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #11958

Re: Infinitely Recursive input on HP Proofs

From Ben Bacarisse <ben.usenet@bsb.me.uk>
Newsgroups comp.theory
Subject Re: Infinitely Recursive input on HP Proofs
Date 2017-03-25 21:58 +0000
Organization A noiseless patient Spider
Message-ID <87h92h6msz.fsf@bsb.me.uk> (permalink)
References (16 earlier) <521efef4-8c19-473c-9551-d676335fe2b8@googlegroups.com> <87lgrxnu0a.fsf@bsb.me.uk> <e6d360f4-cb36-4759-b7d4-98ebbd87342e@googlegroups.com> <87y3vu6tyf.fsf@bsb.me.uk> <9a40ad14-9263-4fad-aaf7-ee8ced10e7ae@googlegroups.com>

Show all headers | View raw


peteolcott <peterolcott2@gmail.com> writes:

> On Friday, March 24, 2017 at 8:11:54 PM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>> 
>> > On Wednesday, March 22, 2017 at 11:42:05 AM UTC-5, Ben Bacarisse wrote:
>> >> peteolcott <peterolcott> writes:
>> >> 
>> >> > On Tuesday, March 21, 2017 at 2:47:06 PM UTC-5, Ben Bacarisse wrote:
>> >> >> peteolcott <peterolcott> writes:
>> >> >> 
>> >> >> > On Monday, March 20, 2017 at 1:07:53 PM UTC-5, Ben Bacarisse wrote:
>> >> >> >> peteolcott <peterolcott> writes:
>> >> >> >> 
>> >> >> >> > On Saturday, March 18, 2017 at 4:35:57 PM UTC-5, Ben Bacarisse wrote:
>> >> >> <snip>
>> >> >> >> >> 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.
>> >> >> >
>> >> >> > I both you and Linz agreed that all of the square circles are blue in
>> >> >> > color you would be wrong. You and Linz said that H^ and H' behave the
>> >> >> > same way and they don't behave the same way.
>> >> >> 
>> >> >> Neither of us say that.  I know you have some trouble with this
>> >> >> material, but do you really not understand how H^ is defined?  
>> >> >
>> >> > There you are not being precise enough with words again. Although 
>> >> > H^ is defined to have a superset of the states of H' this does not
>> >> > logically entail that H^ ever actually behaves like H'. A simple
>> >> > linear execution trace shows that H^ would never reach the H' states. 
>> >> > Because of this H^ and H" never have the same behavior.
>> >> 
>> >> Since you don't yet know what H^ is (and you are steadfastly refusing to
>> >> write out an example so you can see) you can't have a trace of H^.  You
>> >> need to know what the machine is first.  It's probably significant that
>> >> you never read that chapter of the book.
>> >
>> > Every Halting Problem counter-example instance that copies its input
>> > has the same infinitely recursive process of copying its input,
>> 
>> If you did the exercise you'd see this is not the case.  Is that why you
>> won't do it?  If you wrote out an actual H^ you could see what it does.
>> It would be clear there is no "infinitely recursive process of copying
>> its input".
>
> Because H^ contains unspecified sequences of state transitions |-*
> an infinite number of different configurations of H^ are specified.

The only way you will be able to stop believing this is to do the
exercise I suggested.  You'll then see, clear as day, an H^ with no
unspecified sequences of state transitions and only a finite number of
configurations (for any given tape, of course -- even the degenerate 1
state TM has infinite configurations if you include all the possible
tapes it can be started with).

> Within the single element of this infinite set where H^ acts as and
> interpreter (UTM) and simply executes its input state by state, H^ and
> its input unequivocally specify infinitely recursive input.

Pure fantasy.  H^ can behave in many ways -- most of which you have
never even imagined.

> I will probably have to formalize this with my brand new (as of March
> 10, 2017) Minimal Type Theory or it will be too difficult for you to
> see this.

Note that if you succeed in proving what you say it will immediately
show your Minimal Type Theory to be faulty.

>> > I showed this step by step in my other post.
>> >
>> > //  Corrected H^ source (second q0 changed to qc) from page 319 
>> > //  H^ is created from H’ by prepending steps that copy its input 
>> > =>>> q0 Wm |-* H^ qc Wm Wm |-* H^ qy ∞ 
>> > =>>> q0 Wm |-* H^ qc Wm Wm |-* H^ qn 
>> >
>> > Every state transition above is an H^ state transition. I removed the
>> > tape configuration and inserted the qy state back in.
>> 
>> You don't understand this notation.  
>
>> The wrong above right like is not.
> Have no idea what you are saying here. 
> Give me a quote of what you mean by: {above right}.
> The {above right} is not what?

Exactly.  It's garbled isn't it?  Exactly like your garbled use of
Linz's notation.  I just wanted to show you what

  q0 Wm |-* H^ qc Wm Wm |-* H^ qy ∞

looks like to someone who understand the language it's written in.

>> That's how your garbled use of the notation reads to me.  You can't see
>> it because you use mathematical symbols in a sort of poetic way -- your
>> string them together in the hope of conveying some meaning.
>
> You did not notice that the above is a direct quote from Linz?

It isn't.

> (I did remove the tape symbols y1, y2 from this direct quote)
> (I also added back in the qy state shown it the diagram).

Ah.  Here, then, is a direct quote from you:

  "See my 1.5 page incorrect refutation of the Incompleteness Theorem and 
  maybe you will begin to understand how silly I am."

(I did change a couple of things but I don't think they matter.)

<snip>
>> > Here is the common prefix of state transtions:
>> > =>>> q0 Wm |-* H^ qc Wm Wm |-* H^ 
>> >
>> > (1) H^ begins at state q0 with Wm (a TMD of itself) as input. 
>> > (2) H^ copies its input and transitions to qc.
>> > (3) H^ begins processing Wm Wm a pair of TMD copies of itself.
>> > (4) H^ does whatever it does to decide halting for Wm Wm.
>> 
>> Kind of.  From step 3, H^ behaves as H', and H' starts by behaving like
>> H 
>
> Yes at the exact point of step (3) we are at the start state of both
> H' and H.

Odd, then, that you rejected all my attempts to make that clear.  You
flat-out refused to state that qc is the start state of H and H'.  I
think you just say things based on the immediate context without any
memory of what you've said or claimed before.

Anyway, I'm, glad we now agree on what qc stands for (though I think you
contradict yourself below).

>> so what happens from step three is best described in terms of what H'
>> and H do.  
>
> No. Neither H' nor H are exactly H^ and neither H' nor H have (H^, H^)
> as their input. When H^ begins to analyze its input, its input has an
> entirely different start state than either H' or H. (All three
> machines name their start state q0).

Nonsense (literally and figuratively).  Do the exercise and you'll see.
You simply don't know how to use Linz's notation.  I don't see any value
in my explaining it again and I'm sure you won't ever do the simple
exercise so I think you are doomed to stay in this loop indefinitely.

<snip>
>> > If H^ simply acts as an interpreter for its input then:
>> >
>> > (1) Wm begins at its own state q0 with Wm (a TMD of itself) as input. 
>> > (2) Wm copies its own input and transitions to its own qc.
>> > (3) Wm begins processing Wm2 Wm2 a pair of TMD copies of itself.
>> > (4) Wm does whatever it does to decide halting for Wm2 Wm2.
>> 
>> For some H, H^ will do this.  
>
> I have only been talking about the single instance of H^ being
> executed with a TMD of itself as its input, thus there is no H' nor H,
> only H^.

You need to find someone locally who can read what you write and help
you out.  I'm sure you wouldn't believe me if I told you what you've
just said, and I doubt that re-reading it will make you see how absurd
it is.

>> But the construction of H^ lets one deduce
>> something about H' and then about H from this behaviour.  That's a
>> crucial part of the argument.  I don't think you know how to do that,
>> because you've got stuck in a loop of your own.
>
> I cannot understand why you keep jumping around and changing the
> subject away from H^ to either H' or H. I am only talking about H^
> being executed with a TMD of itself as its input.

Because it's what H^ does -- it copies its input and then behaves like
H'.  You can't get anywhere until you stop jumping around and grasp that
basic definition.  If you did the exercise, you might see.

>> <snip>
>> >> > Now like every other definition of the Halting Problem counter-example
>> >> > it is stuck copying its input in infinite recursion.
>> >> 
>> >> Nope.  If you did the exercise you would see that it does not.  I am
>> >> beginning to think you are are too frightened to do it 
>> >
>> > I just did it. I am pretty sure that this is several times now that I did it. 
>> > I tried to make this one more clear.
>> 
>> Please, that just makes you look silly.  You didn't even know what
>> Linz's notation for a TM meant, 
>
> Bullshit.

Great!  So you do understand his notation for a TM?  There is nothing
stopping you from doing the exercise then.  If you don't want to use my
H, write out your own.

-- 
Ben.

Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


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