2 ms·
More specifically, Kolmogorov randomness which is closely linked to compressibility. A sufficiently long string which has a generating program longer than itsel
by tel 17y ago
More specifically, Kolmogorov randomness which is closely linked to compressibility. A sufficiently long string which has a generating program longer than itself is random.
Since "4..." is highly compressible --- its unpredictable error is zero --- it is unlikely to be governed by a random process. The longer the series is, the less likely.
- klipt 17y agoThe funny thing is that pi's decimal digits have very nice "random" properties (e.g. asymptotically uniform distribution), but it's extremely compressible. Which partly explains why it turns up more often than most other transcendentals: http://en.wikipedia.org/wiki/Algorithmic_probability http://en.wikipedia.org/wiki/Algorithmic_probability