Status Updates From Information Theory, Inferen...
Information Theory, Inference, and Learning Algorithms by
Status Updates Showing 1-30 of 154
Tien Le-Quang
is on page 120 of 642
Lempel-Ziv coding
Note from Mackay: given any ergodic source (one that is memoryless on sufficiently long timescales), the Lempel-Ziv algorithm can be proven asymptotically to compress down to the entropy of the source.
…and… a general purpose compressor that can discover the probability distribution of any source would be a general purpose artificial intelligence. (not yet exist)
— May 14, 2024 11:09AM
Add a comment
Note from Mackay: given any ergodic source (one that is memoryless on sufficiently long timescales), the Lempel-Ziv algorithm can be proven asymptotically to compress down to the entropy of the source.
…and… a general purpose compressor that can discover the probability distribution of any source would be a general purpose artificial intelligence. (not yet exist)







