Reconciling Data Compression and Kolmogorov Complexity
From MaRDI portal
Recommendations
Cited in
(17)- Inequalities and algorithms for universal data compression
- An informational approach to the problem of compressing random processes
- Coherence of reducibilities with randomness notions
- Schnorr triviality and its equivalent notions
- Initial segment complexities of randomness notions
- On stability of probability laws with respect to small violations of algorithmic randomness
- Reducibilities relating to Schnorr randomness
- Randomness, computation and mathematics
- ?-Entropy data compression
- Sub-computable bounded pseudorandomness
- Compression and hadamard power inequalities
- Statistical mechanics of the data compression theorem
- Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
- Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
- On a metric generalization of the \(tt\)-degrees and effective dimension theory
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Epsilon Entropy and Data Compression
This page was built for publication: Reconciling Data Compression and Kolmogorov Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428846)