Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site cadovax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!qantel!hplabs!sdcrdcf!trwrb!trwrba!cadovax!keithd
From: keithd@cadovax.UUCP (Keith Doyle)
Newsgroups: net.origins
Subject: Re: Information Generation, Part 2
Message-ID: <725@cadovax.UUCP>
Date: Mon, 29-Jul-85 23:12:01 EDT
Article-I.D.: cadovax.725
Posted: Mon Jul 29 23:12:01 1985
Date-Received: Sat, 3-Aug-85 02:16:17 EDT
References: <32500043@uiucdcsb>
Organization: Contel Cado, Torrance, CA
Lines: 20

........
>Well, this is easily checked.  Given 27 characters (including blank) the number
>of combinations of length 23 is 834,385,168,331,080,533,771,857,328,695,283.
>Assuming 1 trillion generations/second (extraordinarily generous!!!) for
>22 billion years (anyone here think its older than that?) then, well, the rest
>is left as an exercise to the reader...  So, Andy, why don't you do some back
>of the envelope calculations and give us a rate/age which will return
>probabilities that "will indeed become high"?

Yes, but how many of those combinations contain 'information'?  And, is 23
the only length that produces 'information'?  You're example would seem
to indicate that there is only 1 right answer, while there actually may be
billions (or even more!).

>A. Ray Miller
>Univ Illinois

Keith Doyle
#  {ucbvax,ihnp4,decvax}!trwrb!cadovax!keithd