Re: WARNING: Do NOT calculate Pi in binary
anyway.
So, to check out compression of a random file, i took some 4-digit binary sequences,
like
0101,
1100,
0001,
0111,
etc.
Then i programmed my calculator to spit out 1s and 0s randomly, and counted how many digits were put out before getting to my 4-bit string of choice. Obviously it showed compression as impossible for a random file.
But fun question:
which 4-bit strings were likely to occur quickly (on average)?
which ones took longer?
why?
|