Random [OT]

[Hugo Pfoertner]

Jim Nastos wrote:
> 
> On Fri, 18 Jun 2004, Pfoertner, Hugo wrote:
> 
> > The topic "what is random" has been exhaustively discussed in NGs sci.math,
> > sci.crypt, comp.compression, etc. A lot of material on (Pseudo-)Random
> > numbers
> > can be found in D. Knuth's TAOCP (Vol. 2?).

TAOCP, 3rd Edition, Vol.2, Chapter 3.5
"What is a random sequence?", Pages 149--183

> 
>   In addition to all of Hugo Pfoertner's suggestions, there is a neat
> measure of randomness related to incompressibility (which has obvious
> applications in the field of data compression.) This is commonly discussed
> in the context of Kolmogorov complexity.
> 
> J

[slighly off-topic wrt. integer sequences]

To those who are interested in the connection between randomness and
data compression it might be worthwhile to browse through a thread
"Subject: extra information in bits?" started by Charles Bloom
in the NG comp.compression, Date: 1997/12/23
http://groups.google.de/groups?selm=67o8c4%24e1j%241%40scream.auckland.ac.nz

Charles Bloom's web page has some nice material on the Kraft inequality,
minimum entropy coders, etc.
http://www.cbloom.com/news/index.html
Statistical Coders: http://www.cbloom.com/algs/statisti.html

Hugo