Late re-post for Jixuan Hu
Cliff Joslyn (joslyn@KONG.GSFC.NASA.GOV)
Thu, 11 Jan 1996 16:43:10 -0500
>Date: 8 Dec 1995 10:34:10 -0800
>From: "Jixuan Hu" <jixuan_hu@qmbridge.calstate.edu>
>Subject: FWD>Rejected posting to PRN
>To: "Cliff Joslyn" <joslyn@kong.gsfc.nasa.gov>
>
>Mail*Link(r) SMTP FWD>Rejected posting to PRNCYB-L@BINGVMB
>
>Hi Cliff, the following is a reply to a PCP post. The system refused my direct
>post (of course, my California account is not on your list), so I pass it to
>you. Yes yes it's high time I should introduce myself on PCP -- I promise you
>that I'll do it as soon I know where I will be in Spring 1996. All the best.
>Jixuan
>-------------------------------------------------
> Reply to: RE>help - reference on "practical" computational limits!
>
>It is Bremermann's Limit: 10^47 bits/gram/sec. It means nothing made of matter
>(machine or brain) can process information faster than this limit.
>Bremermann,
>H.J., "Quantal Noise and Information." 5th Berkeley Symposium on Mathematical
>Statistics and Probability, 4(1967):15-20. W. Ross Ashby had discussed it in
>several articles. I used it as one of my supporting point in my papers "The End
>of Utopia: On the Nondesignability of Social Systems," Cybernetics and Systems
>6(1988):76-85, and "The Nondesignability of Living System: A Lesson from the
>failed experiments in socialist countries," Cato Journal. vol.11, No. 1
>(Spring/Summer 1991). Hope this helps.
>Jixuan Hu, Ph.D
>jixuanhu@gwis2.circ.gwu.edu
>http:\\gwis2.circ.gwu.edu\~jixuanhu
>--------------------------------------
>Date: 12/8/95 8:00 AM
>To: Jixuan Hu
>From: Principia Cybernetica Project
>There is a paper (and I am pretty sure it was also summarised in a
>Scientific American article) which makes an estimate of the maximum
>number of bits that could be processed by the universe given a
>quantum limit on the amount of bits per mass per time, and guesses as
>to the total mass and time left in our universe.
>
>The answer was quite large (of the order of 10^300, I seem to recall),
>but still small compared to an exhaustive search of a game like Go
>(with 10^800 possible games) or other combinatronic problems.
>
>Can anyone help with this reference? I have searched everywhere in
>my databases. Thanks.
>
>----------------------------------------------------------
>Bruce Edmonds
>Centre for Policy Modelling,
>Manchester Metropolitan University, Aytoun Building,
>Aytoun Street, Manchester, M1 3GH. UK.
>Tel: +44 161 247 6479 Fax: +44 161 247 6802
>http://bruce.edmonds.name/bme_home.html
>
>
>
>------------------ RFC822 Header Follows ------------------
>Received: by QMBRIDGE.CALSTATE.EDU with SMTP;8 Dec 1995 10:18:13 -0800
>Received: from BINGVMB by BINGVMB.cc.binghamton.edu (IBM VM SMTP V2R2)
> with BSMTP id 3777; Fri, 08 Dec 95 13:17:18 ECT
>Received: from BINGVMB.CC.BINGHAMTON.EDU by BINGVMB (Mailer R2.10 ptf000) with
> BSMTP id 9520; Fri, 08 Dec 95 13:17:17 ECT
>Date: Fri, 8 Dec 1995 13:17:17 +0000
>From: BITNET list server at BINGVMB (1.8a)
> <LISTSERV@BINGVMB.cc.binghamton.edu>
>Subject: Rejected posting to PRNCYB-L@BINGVMB
>To: jixuan_hu@QMBRIDGE.CALSTATE.EDU
>
O---------------------------------------------------------------------------->
| Cliff Joslyn, NRC Research Associate, Cybernetician at Large
| Mail Code 522.3, NASA Goddard Space Flight Center, Greenbelt, MD 20771 USA
| joslyn@kong.gsfc.nasa.gov http://pespmc1.vub.ac.be/joslyn 301-286-5773
V All the world is biscuit-shaped. . .