Re: Random data cannot be compressed

Richard Heathfield <rjh@[EMAIL PROTECTED]
> wrote on Sat, 08 Mar 2008:
> An entirely random process can put out *any* bit stream and some bit
> streams are compressible. QED as far as I'm concerned.

Yet you continue to persist in the confusion between
1. What is the Kolmogorov complexity of a static sequence of data?; and
2. Is there any algorithm which can, on average, compress the storage/
   transmission size requirements of the output of a random process?

Your statement is "true", modulo some carefully chosen definitions for
"random process", "compressible", etc.

And yet it in no way contradicts the subject line of this thread.

So the error is not in your statement.  It is in your "QED" belief that
you
have said something relevant to the topic of whether "random data can[not]
be compressed".  You haven't.  You've merely written a non-sequitur.

        -- Don
_______________________________________________________________________________
Don Geddis                  http://don.geddis.org/
             
don@[EMAIL PROTECTED]
 me, there's no better symbol for the world than a grasshopper lying
dead on
a gravel road, and maybe there's a globe lying next to him.
	-- Deep Thoughts, by Jack Handey