Automatic complexity. A computable measure of irregularity
From MaRDI portal
Publication:6063553
Recommendations
- scientific article; zbMATH DE number 1747450
- An introduction to Kolmogorov complexity and its applications
- Kolmogorov Complexity and Algorithmic Randomness
- Methods and applications of algorithmic complexity. Beyond statistical lossless compression
- Automatic Kolmogorov complexity and normality revisited
Cited in
(2)
This page was built for publication: Automatic complexity. A computable measure of irregularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063553)