2 ms·
Summary: Any sufficiently complex Markov source is indistinguishable from random (until you read enough characters). A mathematical re-evaluation of the limits
by cperciva 16y ago
Summary: Any sufficiently complex Markov source is indistinguishable from random (until you read enough characters).
A mathematical re-evaluation of the limits on data compression? No, not really.