3 ms·
Card Trick Leads to New Bound on Data Compression
- cperciva 16y agoSummary: 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.
- ax0n 16y agoIsn't this somewhat how time-coding vinyl is configured (i.e. Final Scratch and Traktor?)