From: Eli Brandt <ebrandt@jarthur.Claremont.EDU>
To: cypherpunks list <cypherpunks@toad.com>
Message Hash: f5cfa31956dbe1892fb41a31d3df3a1f94d11a24a12170a48efea5e9021c9fe3
Message ID: <9312030401.AA12564@toad.com>
Reply To: <9312030219.AA08840@ininx>
UTC Datetime: 1993-12-03 04:02:36 UTC
Raw Date: Thu, 2 Dec 93 20:02:36 PST
From: Eli Brandt <ebrandt@jarthur.Claremont.EDU>
Date: Thu, 2 Dec 93 20:02:36 PST
To: cypherpunks list <cypherpunks@toad.com>
Subject: Re: Entropy, Randomness, etc.
In-Reply-To: <9312030219.AA08840@ininx>
Message-ID: <9312030401.AA12564@toad.com>
MIME-Version: 1.0
Content-Type: text/plain
> Program-length complexity is well-studied in the literature. A good
> introductory paper is ``A Theory of Program Size Formally Identical to
> Information Theory'' by G. J. Chaitin, _Journal of the ACM_, 22 (1975)
> reprinted in Chaitin's book _Information Randomness & Incompleteness_,
> World Scientific Publishing Co., 1990.
The Li+Vitanyi chapter in the _Handbook of Theoretical Comp. Sci_,
Vol. A, is a nice review. And your library probably has the book,
while it may not have their new text.
> John E. Kreznar
Eli ebrandt@jarthur.claremont.edu
PGP 2 key by finger or e-mail
"Your hideous criminal clock, your insidious time
bomb, is tick-tick-ticking." -- L. Detweiler
Return to December 1993
Return to “tcmay@netcom.com (Timothy C. May)”