News for hackers. Stuff that matters.
Re:The enigma of the Ford paradox by AnthonyMouse on Thursday March 07, 2013 @02:43PM (#5339693)
>Consider any number which can be expressed as a patterned continued fraction, like pi or e. pi's digits are such that it is very hard to compress, but it is absolutely trivial to generate.

You're confusing theoretical compressibility with the actual compression ratios you get when you put a string through typical compression functions.

Here's a different example. Suppose you have ASCII text encrypted with AES with the AES decryption key appended to it. Run that through gzip and you'll probably get output which is larger than the input. But here's a different compression algorithm that will work much better: Decrypt the encrypted data with the key and then compress the plaintext with gzip.

It isn't that the original string is of the sort that can't be compressed, it's that you need a compression function which is suited to the input. Pi is like that.

Compare this to other strings, like the output of an environmental hardware random number generator, which will almost always be totally incompressible whatsoever.

There are no comments on this comment yet.