2 ms·
Let's say you take an algorithm for generating the digits of pi, and run it on 2 computers. One you let run only a short time and it produces a string 100,000 d
by snowwrestler 14y ago
Let's say you take an algorithm for generating the digits of pi, and run it on 2 computers. One you let run only a short time and it produces a string 100,000 digits long. The other you let run for a longer time and it produces a string one million digits long.
Would you argue that these two strings should compress to the same size because the source code that generated each of them is the same size?
edit: to clarify my question
- lmm 14y agoYes, very much so. You'll find that most compression algorithms will do this for a string of zeroes (i.e. 100,000 zeroes will compress to approximately the same size as 1,000,000 zeroes) or 1s, or simple repeating patterns. I don't know whether any common compression algorithm is "smart" enough to be able to compress the digits of pi, but a "perfect" compression algorithm certainly would be.