HDTenEightyP/NetNews huggingface dataset:
From: "timothy moeller" <timothy.moeller@channel1.com>
Newsgroups: rec.arts.sf.tv
Subject: outer limits episode
Date: 18 Nov 92 09:36:47 EST
Reply-To: "timothy moeller" <timothy.moeller@channel1.com>
Distribution: rec
Organization: Channel 1 Communications

Since I received such a flood of good responses to another question I
posted recently in rec.arts.sf.written, I thought I'd ask another
question here...

It concerns an episode of _Outer Limits_ that I saw only the first
few minutes of when it originally aired. I never got to see the
complete episode because we had a power outage just after the teaser.
Then a few years later when the same episode was being re-broadcast,
by an incredible coincidence we had a power outage again, at almost
exactly the same point in the show!  Anyway, I've never been able to
catch the episode again. However, I have just come across a company
that is selling episodes of OL on video tape, so I'd like to identify
which episode that was by name so I can finally see it.

  The episode of _Outer Limits_ I remember starts out in a laboratory
  with a glass dome containing a miniature sample of some alien
  planet, complete with trees; the sample is being kept alive by an
  artificial environment, including artificial lighting cycling at an
  accelerated rate to simulate the planet's home sun.

That's all I saw of that episode. Does anyone remember anything more?
More importantly, does anyone know the name of this episode? Thanks
for any help. Please E-mail responses to:

    timothy.moeller@channel1.com


 -- Timothy
--
Channel 1 (R)   Cambridge, MA

Newsgroups: rec.arts.sf.tv
From: ghost@openage.openage.com (Glenn Host)
Subject: Re: QL: The Musical Collection
Organization: Open Age, Inc.
Date: Thu, 19 Nov 1992 17:24:14 GMT

With all of the interest in QL - when is Quantum Leap going to do a musical
ala West Side Story?

Al doesn't have to sing of course since he is only heard by Sam :)

-- 

                      Glenn E. Host - Reston, VA
Very grateful guest of Openage - the best SCO service shop in the area
************* my views represent no one - not even myself. ****************
Newsgroups: rec.arts.sf.tv
From: baylor@nebula.ssd.lmsc.lockheed.com
Subject: Re: QL: Al's Cigars...
Reply-To: baylor@nebula.ssd.lmsc.lockheed.com
Organization: LMSC, Sunnyvale, California
Date: Mon, 23 Nov 92 19:40:52 GMT

In article <p0118=q@rpi.edu>, dzembj@nuge115.its.rpi.edu (Jason Eric Dzembo) writes:
>In article <fletch.722288011@camelot>, fletch@camelot.bradley.edu (Alan Lurie) writes:
>|> 
>|> 	Okay.  I posted this before, but no one responded.  So, I wondered
>|> if it was ever posted at all.  Anyway, I had posted something like a trivia
>|> question:  WHAT KIND OF CIGARS DOES AL SMOKE?
>|> 
>|> 	If you know, please enlighten the huddled massess...Thank you.
>|> 
>
>Well, I don't smoke, myself, but I believe Al smokes Habanas (Havanas?).
>I haven't a clue what one of these is, but I remember him mentioning that
>sort of cigar in "A Little Miracle."  In another episode, I believe it was
>"The Wrong Stuff", Al mentions the place where his cigars were made, I believe
>in connection with where one of the doctors was originally from.
>Hope that helps.
>
>						- Jason
>						(Who needs a .sig?)
I just saw _Wrong Stuff_. It was Kamroon Africa.
Date: Tuesday, 17 Nov 1992 17:11:31 EST
From: <RVESTERM@vma.cc.nd.edu>
Newsgroups: rec.puzzles
Subject: Re: Special sentence
Distribution: world
 <1ebg66INNm1l@gap.caltech.edu>

regarding this carl j. person's "dyslexia and simou", think in
capital letters, man.

         SIMON NOW IS

you'll also notice that 3 and e were supposed to be the same, rotated.
this is blatantly false, unless you think in capitals- 3, E.

bob vesterman.
Newsgroups: rec.puzzles
From: difelici@wam.umd.edu (John Patrick DiFelici)
Subject: Re: Billion-year survivability
Keywords: pi, Louie
Organization: University of Maryland, College Park
Date: Wed, 18 Nov 1992 18:35:10 GMT


If you wanted to hand deliver the message, you could fly off into space in
a rocket ship traveling near the speed of light.  Time it just right so that
when you get back to Earth, the Earth's time frame has advanced 1 billion
years.  You could then, hand deliver the message, as well as become the
oldest living human in existance, at least going by your birth date.

SPUDS
From: varhus@eniac.seas.upenn.edu (Kristofor A Varhus)
Newsgroups: rec.puzzles
Subject: Re: Sequence
Date: 17 Nov 92 02:48:29 GMT
Organization: University of Pennsylvania

In article <19921116.170715143595.NETNEWS@BLEKUL11> pirard@vm1.ulg.ac.be (Andre' Pirard) writes:
|>1
|>11
|>21
|>1211
|>111221
|>?
|>
|>-----
|>Andre Pirard          SEGI, Univ. de Li`ge         139.165 IP coordinator
|>B26 - Sart Tilman     B-4000 Li`ge 1 (Belgium)            +32 (41) 564932
|>pirard@vm1.ulg.ac.be  alias PIRARD@BLIULG11.BITNET

<groooaaaannnn>  Oh no, not this again!

--
-------------------------------------------------------------------------------
Kristofor A. Varhus			|       THIS SPACE AVAILABLE
varhus@eniac.seas.upenn.edu		|        E-MAIL IMMEDIATELY!
-------------------------------------------------------------------------------
Newsgroups: rec.puzzles
From: dant@techbook.com (Dan Tilque)
Subject: Re: Internet supercomputer (WAS: Re: Elements ending in H)
Organization: Pseudopolis Yard
Date: Thu, 19 Nov 1992 02:35:49 GMT

nsmith@tms390.micro.ti.com (Neal Smith) writes:
}jacobw@phoenix.Princeton.EDU (Jacob Solomon Weinstein) writes:
}
}>You know, it occured to me that, taken as a whole, the Internet is
}>the most powerful supercomputer in the world, if you include in the 
}>system the minds linked by it.
}
}Unfortunately, it's also correspondingly slow... :v)

Too much thrashing...

---
Dan Tilque    --     dant@techbook.com
Newsgroups: rec.puzzles
From: jes@downey.dev.macsch.com (John Schiermeier)
Subject: Re: Great turtle race
Organization: The MacNeal-Schwendler Corporation
Date: Tue, 17 Nov 92 20:52:55 GMT

In article <1992Nov16.215430.7907@stsci.edu> ansok@stsci.edu (Gary Ansok) writes:
>In article <1992Nov16.182241.3270@draco.macsch.com> jes@downey.dev.macsch.com (John Schiermeier) writes:
>>In article <1992Nov12.192101.13105@hellgate.utah.edu> tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman) writes:
>>>Quite peculiar!  Yet no turtle placed the same in both races.  Happily,
>>>after they computed their overall rank for the day every turtle got
>>>a medal.. gold, silver or bronze for 1,2 or 3rd.
>>
>
>>The first race:   E A B D C F
>>The second race:  A C D B F E
>>
>>The medals:  gold, A; silver, B C D E; bronze, F.
>
>This depends on the interpretation that if there is a tie for one
>place, then all of those tied win that place and the next place
>is awarded to the next one down.  In other words, the turtles
>finished 1-2-2-2-2-3.
>
>I don't agree with this -- I would consider Frank to have finished
>6th overall in this ranking and would thus not be awarded a medal 
>(no bronze medal to be awarded when multiple silvers given out).
>Isn't this how the Olympics do it when there is a dead heat?
>

I don't agree with this either, but didn't find another acceptable
solution, and so posted the above.  Yes, that's how the Olympics
does it.

>The only finishes that I would consider to allow every turtle a
>medal are:  1-2-3-3-3-3, 1-1-3-3-3-3, 1-2-2-2-2-2, and 1-1-1-1-1-1.
>
>I come up with 5 possible race outcomes; 7 combinations of which satisfy
>the restriction that no turtle finish the same in both races.  Three of
>these combinations give each turtle a medal under the "loose" tie policy,
>but no combination satisfies the tighter tie policy.  (Also, no combination
>satisfies the interpretation with medals for each race.)
>
>Race outcomes:
>
>  A C D B F E
>  A E D B F C
>  D E F A B C
>  E A B D C F
>  E D A F C B
>
>Combinations:
>
>E A B D C F
>A C D B F E             A gold  B/C/D/E silver  F bronze?
>
>E A B D C F
>A E D B F C             A/E gold  B/D silver?/bronze?  C/F bronze?
>
>D E F A B C
>E D A F C B             D/E gold  A/F silver?/bronze?  C/B bronze?
>
Oops - missed one outcome, and transcribed another incorrectly, leading
to my finding only one combination with three ranks instead of three.
That's what I get for doing everything by hand.

Perhaps the person who posed the puzzle would care to offer a solution?

John
From: mk0e@ns1.cc.lehigh.edu (MAHEENDRA BABURAO KASMALKAR)
Newsgroups: rec.puzzles
Subject: Re: Songs containing states
Date: 18 Nov 92 03:36:13 GMT
Organization: Lehigh University

In article <1992Nov14.045121.7060@ils.nwu.edu>, blum@medici.ils.nwu.edu (Dan Blu
m) writes:
>So what happened to Virginia?  "Carry Me Back to Old Virginia" is the
>most obvious song, although there must be others.  I've heard a song
>which mentions West Virginia (God knows why) but I don't know the title.
>

Almost heaven, West Virginia
Blue Ridge mountains , Shenandoah river !

This is in "Country road, take me home" by John Denver.

Kassu

-- 
------------------------------------------------------------------
!  My life in US :            !      Maheendra Kasmalkar         !
!                             !      mk0e@lehigh.edu             !
!  Apartment , Department     !      mk0e@ns1.cc.lehigh.edu      !
!  Advisor and Budweiser      !      (215)-758-8081              !
------------------------------------------------------------------
Organization: Freshman, MCS general, Carnegie Mellon, Pittsburgh, PA
Newsgroups: rec.puzzles
Date: Tue, 17 Nov 1992 13:07:37 -0500 
From: Steven Pei-Han Chai <sc5x+@andrew.cmu.edu>
Subject: Re: the question is the answer ?!

Excerpts from netnews.rec.puzzles: 16-Nov-92 Re: the question is the
ans.. D. SPENCER BEECHER@ns1.c (537)

> >>> Q: How many letters are in the answer?

> After giving it a great deal of thought and consulting with nobody
> in particular, but resorting to a great deal of wanton typing with
> little or no point, I have decided that the definative answer, for
> all practical purposes is no finite number, but sensitive to the
> circumstance, and in this specific situation totals exactly three
> hundred letters, no more, and no less.
> -- 
>                    _ _     _ _     _ _
>   -Spence         [O.O]   )x.x(   )O.O(
>                     O       O      -*-


Nice answer!

---Happy  (happy+@cmu.edu)
Newsgroups: rec.puzzles
From: ralf@ark.abg.sub.org (Ralf Stephan)
Newsgroups: rec.puzzles
Subject: Re: Internet supercomputer (WAS: Re: Elements ending in H)
Date: 20 Nov 92 19:35
Organization: Not Very Ltd.

dant@techbook.com (Dan Tilque) writes:
> nsmith@tms390.micro.ti.com (Neal Smith) writes:
> }jacobw@phoenix.Princeton.EDU (Jacob Solomon Weinstein) writes:
> }
> }>You know, it occured to me that, taken as a whole, the Internet is
> }>the most powerful supercomputer in the world, if you include in the 
> }>system the minds linked by it.
> }
> }Unfortunately, it's also correspondingly slow... :v)
> 
> Too much thrashing...

Right.  Wasn't there a factorization of a large (Fermat?) number organized
through the Internet?  Can someone give the story?  Thanks.

ralf
--
***********************************************************************
PLEASE NOTE: Some Quantum Physics Theories Suggest That When the Reader
Is Not Directly Observing This Message, It May Cease to Exist or Will
Exist Only in a Vague and Undetermined State.
From: johnh@xanth.CS.ORST.EDU (John E. Holeman)
Newsgroups: rec.puzzles
Subject: Re: Billion-year survivability
Date: 23 Nov 92 06:58:50 GMT
Article-I.D.: flop.1epvfaINNla5
Organization: Oregon State University
NNTP-Posting-Host: xanth.cs.orst.edu

In article <tim.722137373@giaeb> tim@giaeb.cc.monash.edu.au (Tim Roberts) writes:
>tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman) writes:
>
>>>If I wanted to send information to a society that will inhabit the earth
>>>one billion years in the future, how would I do it?
>
Wouldn't it be possible to leave the message in the form of a radioactive
substance with a half-life of nearly a billion years and contrast it with
some substance which is either stable or has a different half-life, so that 
when a billion years rolls around the message "appears" to anybody
who has the ability to detect it?  Of course this assumes that it will be
left somewhere where it can be found and that the existing society can 
interprit the message...
Newsgroups: rec.puzzles
From: umahf69@ma.ic.ac.uk (Nairo Aparicio)
Subject: Re: Number Puzzle
Organization: Imperial College Mathematics Department
Date: Thu, 19 Nov 92 17:49:01 GMT

2  10526315789473684
3  103448275862068965517241379
4  10256
5  10204081632653061224489795918367346938775
6  101694915254237288135593220338983050847457627118644067796
7  101449275362318840579
8  101265822784
9  1011235955056179775280898876404494382022471

All of  them can be calculated by hand in the usual manner as we multiply two numbers, 
since the last figure is known, and therefore the one which follows it and so on until getting 
the figure we want.

My calculator only has 10 figures, so there may be errors, I did not have the time to check them.


					Nairo Aparicio
From: varhus@minuet.seas.upenn.edu (Kristofor A Varhus)
Newsgroups: rec.puzzles
Subject: Re: Our favorite series
Keywords: Memphis Blues again
Date: 18 Nov 92 17:48:50 GMT
Organization: University of Pennsylvania

Sorry.  Unfortunately, I haven't seen the FAQ.  If you don't want people to 
post these sorts of things, maybe you should post the FAQ a little more often.

--
-------------------------------------------------------------------------------
Kristofor A. Varhus			|       THIS SPACE AVAILABLE
varhus@eniac.seas.upenn.edu		|        E-MAIL IMMEDIATELY!
-------------------------------------------------------------------------------
From: blom@husc15.harvard.edu
Newsgroups: rec.puzzles
Subject: Another sequence
Date: 17 Nov 92 23:13:10 GMT
Article-I.D.: husc15.1992Nov17.181310.17548
Organization: Harvard University Science Center

Here's another interesting sequence, though more intuitive:

2
11
12
122
12211
1221121
1221121221
...
(eventually) 1221121221221121122121...

Prove that the infinite sequence never repeats.

--Eric Blom
  Harvard
Newsgroups: rec.puzzles
From: Dave Dodson <dodson@convex.COM>
Subject: Re: rec.puzzles FAQ comments [POSSIBLE SPOILERS]
Originator: dodson@bach.convex.com
Date: Mon, 16 Nov 1992 15:48:19 GMT
Reply-To: dodson@convex.COM (Dave Dodson)
Organization: Engineering, CONVEX Computer Corp., Richardson, Tx., USA
X-Disclaimer: This message was written by a user at CONVEX Computer
              Corp. The opinions expressed are those of the user and
              not necessarily those of CONVEX.

In article <1992Nov15.192345.19733@thunder.mcrcim.mcgill.edu> mouse@thunder.mcrcim.mcgill.edu (der Mouse) writes:
>[The FAQ says]
>> ==> induction/paradox.p <==
>> What simple property holds for the first 10,000 integers, then fails?
>> ==> induction/paradox.s <==
>
>The solution given involves a recusive equality of four terms.  Far
>simpler than this, in my opinion, is the property of being no greater
>than 10000.  (Duh!)

I may be being overly pedantic, but there is no first integer, so there
can be no 'first 10,000 integers.'

----------------------------------------------------------------------

Dave Dodson		                             dodson@convex.COM
Convex Computer Corporation      Richardson, Texas      (214) 497-4234
Newsgroups: rec.puzzles
From: russotto@eng.umd.edu (Matthew T. Russotto)
Subject: Re: SURWDKGO
Date: Sat, 21 Nov 92 23:57:55 GMT
Organization: Project GLUE, University of Maryland, College Park

In article <5857@osc.COM> Joe Keane <jgk@osc.com> writes:
>What is the next letter in this sequence:
>
>ETIANMSURWDKGO
>
>There is a definite answer.
H

This is obviously the beginning of the string of Jim Hague's 1986
Obfuscated C contest winner.
-- 
Matthew T. Russotto	russotto@eng.umd.edu	russotto@wam.umd.edu
Some news readers expect "Disclaimer:" here.
Just say NO to police searches and seizures.  Make them use force.
(not responsible for bodily harm resulting from following above advice)
Newsgroups: rec.puzzles
From: tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman)
Subject: Re: message for the future
Date: 20 Nov 92 17:01:06 MST
Organization: University of Utah, CompSci Dept

>> 		I have a much better idea. Take a dead satelite. A big one,
>> 	like say the moon. Then blast its surface with  enough nukes to
>> 	make an easily recognisable pattern that would be only partly
>> 	erased by comet and meteoride collisions. Then just for good measure,
>> 	adjust the rotational velocity of the moon so that the message
>> 	always faces the earth. The message could be something like
>> 	a big face......................

>Ummm.....  I kinda always thought that the moon always DID show the same side to
>the Earth.... That's why its called the "Dark Side Of the Moon".

Ummm.....  if you listen to Pink Floyd's album, at the very end, they say
"There really is no dark side of the moon."  They say this because whether
the moon faces the earth or not has nothing to do with the dark side.
What is a new moon?


>I suppose you say that over the next couple million years that the moon's
>rotational velocity will change enough to change the face

The rotational velocity of the moon HAS changed, because the moon causes
tidal motion which sucks energy out of its orbit.  That is WHY the moon
faces the earth.  The only way the moon could change its rotational velocity
to begin an uncoupled rotation would be an act of god, or else someone 
giving it some extra energy.  It would not happen on its own.


> but, then again, over
the next couple million years, the millions of asteroids and meteors hitting it
>will probably change it quite a bit as well.

I'll agree with this.  Anything on the moon's surface would be long 
buried after a few million years.

>				Just Nit-pickin',

Just nit-pickin.
Newsgroups: rec.puzzles
From: jacobw@phoenix.Princeton.EDU (Jacob Solomon Weinstein)
Subject: Re: Anagram generator wanted...
Originator: news@nimaster
Organization: Princeton University
Date: Tue, 17 Nov 1992 07:40:11 GMT

mag@cs.uiuc.edu writes:
>bickford@jimmy.dfci.harvard.edu (Paul Bickford) writes:
>>>I am interested infinding an anagram generator, too, but I am looking for
>>>on the Macintosh platform. Anyone have any leads?
>>>
>>Check out "Ars Magna" on sumex-aim. I believe it's in the "games"
>>directory, although it could be in "misc." It has a really kludgy
>>interface, but it works pretty darn well.
>
>It's in the "game" directory.  It is worth noting that the program
>doesn't like to run under System 7 (at least not on my Quadra 700 :-(
>-- I believe somebody else said it ran, but a little quirkily)

It runs fine on my SE with System 7 and Tuneup 1.1.1.
From: clong@remus.rutgers.edu (Chris Long)
Newsgroups: rec.puzzles
Subject: Re: Gale and Bridges (PARTIAL SPOILER)
Date: 22 Nov 92 06:54:49 GMT
Organization: Rutgers Univ., New Brunswick, N.J.

In article <1992Nov20.191537.27029@cc.ic.ac.uk>, Nairo Aparicio writes:

> Here there is a problem published on one of the boards of this department:
> "In a certain wide river, there are 6 islands joined to each other and
> the banks by 13 bridges, as shown below.   Unfortunately if there is a
> gale, the bridges will each collapse with independent probability 1/2.
> What is the probability that the river will be crossable after the gale?"

The river will be crossable iff there is a path from top to bottom;
it will be uncrossable iff the river has a path from left to right.
In the case for a rectangular bridge grid of mxn islands with probability
of collapse p the associated river grid is also rectangular but with size
(n-1)x(m+1) and (essentially) probability of collapse of 1-p.  Therefore,
P(m,n,p) = 1-P(n-1,m+1,1-p); for the given problem we get P(2,3,1/2) =
1-P(2,3,1/2) ==> P(2,3,1/2) = 1/2.  For general p the problem is more
tedious; I haven't done the computation yet, but I get that it's a
polynomial of degree 13 in p.
-- 
Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618
Newsgroups: rec.puzzles
Subject: Re: Sequence
From: jhsegal@wiscon.weizmann.ac.il (Livian)
Date: Wed, 18 Nov 1992 16:50:08 GMT
Organization: Weizmann Institute of Science, Computation Center

In article <19921116.170715143595.NETNEWS@BLEKUL11> Andre' Pirard <pirard@vm1.ulg.ac.be> writes:
>1
>11
>21
>1211
>111221
 212111

Don't ask me why! It's my wild guess.
CU
                                   ___
                                  (o o)
 ------------------------------ooO-(_)-Ooo------------------------------------
  __     __  __    ___ __     _     ___   __
    |      |   \     /   |     \       \    | VM/CMS:
    |      |    \   /    |    _ \       \   | JHSEGALL @ Weizmann.weizmann.ac.il
    |___   |       /     |    _  \    |  \  | UNIX:
        |  |      /      |   /    \   |     |  JHSEGAL  @ Wiscon.weizmann.ac.il
Xref: sparky rec.puzzles:7414 rec.org.mensa:8436
From: clong@remus.rutgers.edu (Chris Long)
Newsgroups: rec.puzzles,rec.org.mensa
Subject: Re: The Crypto-Analogies Test
Date: 20 Nov 92 22:12:26 GMT
Followup-To: rec.puzzles
Organization: Rutgers Univ., New Brunswick, N.J.

In article <Nov.20.02.15.43.1992.6842@romulus.rutgers.edu>, Chris Long writes:

>  8. 10^30: NONILLION:: 100^100:: ?

As a few people have pointed out, this should be 10^100, not 100^100.
I came across this typo when solving it and forgot about it.
-- 
Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618
Newsgroups: rec.puzzles
From: kanad@quip.eecs.umich.edu (Kanad Chakraborty)
Subject: A high school geometry (?) problem.
Organization: University of Michigan EECS Dept., Ann Arbor, MI
Date: Mon, 23 Nov 1992 20:00:23 GMT

I posted this puzzle a long time ago on this newsgroup but 
did not get back any *correct* response. One response which
*appeared* correct at first glance had a serious flaw in it.
This problem has a history. You may skip the next paragraph
and cut right to the chase if you're impatient to go through
the history.

In high school, I was given this geometry problem (as a homework
assignment) which resisted every attempt at solving.  None of
the students, me including (can you believe it ?  :) :) :) :))
or the teacher could solve this problem either,
and in the end, the teacher conceded defeat and was somewhat
apologetic about giving us this innocent-looking killer that he
pulled off the top of his head. I am still mystified by the problem 
and wish to know if it has a simple, neat, geometrical solution (or
any other solution, though a geometrical one would be most welcome
as my high-school trigonometry has become too rusty).

Prove that if two angle bisectors of a triangle are of equal
length, (as measured from the vertex to the point of intersection
with the opposite side), the triangle is isosceles.

Kanad Chakraborty
From: chris@questrel.com (Chris Cole)
Newsgroups: rec.puzzles
Subject: Re: Mini-FAQ
Date: 23 Nov 92 19:36:30 GMT
Organization: Questrel, Inc.

In article <62246@mimsy.umd.edu> sjsmith@cs.umd.edu (Stephen Joseph Smith) writes:
>The rec.puzzles FAQ is incredible.  It covers an enormous range of puzzles.
>
>The only problem is... it's *too* big.  Few first-time posters to the
>newsgroup are going to read it all.
>
>I propose that somebody creates a mini-FAQ containing the *really*
>frequently asked questions...  Proposed entries:

I too think this is a very good idea.  I propose that we call the VFAQ
simply the FAQ, and the current FAQ the "archive" or some such.  In fact,
I have a list of the most requested questions from the archive which I
will happily provide to the maintainer of the FAQ.  In order to simplify
things operationally, if you're interested in maintaining the FAQ, please
let me know.  If there are several volunteers, I will try to adjudicate
between them.  If there are no volunteers, I will attempt to arm-twist
certain regular contributors whose names come to mind ...

By the way, I would also like to solicit suggestions from regular readers
about what should be on the FAQ.  I will pass these suggestions on to the
eventual maintainer.  Please email these suggestions to me.  The already
posted ones will of course be considered.

Chris