Robust Measures of Information

DOI10.1093/COMJNL/42.4.284zbMATH Open0937.68060OpenAlexW2141307823MaRDI QIDQ4933947FDOQ4933947

Authors: Leonid A. Levin 

Publication date: 17 January 2000

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/42.4.284

Recommendations

• Kolmogorov complexity, pseudorandom generators and statistical models testing.
• Almost everywhere high nonuniform complexity
• Kolmogorov complexity and probability measures.
• Equivalence of measures of complexity classes
• Measure on P: Robustness of the notion

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

This page was built for publication: Robust Measures of Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933947)