Depth as randomness deficiency
From MaRDI portal
Publication:733740
DOI10.1007/s00224-009-9171-0zbMath1183.68317arXiv0809.2546WikidataQ62038791 ScholiaQ62038791MaRDI QIDQ733740
Luís Antunes, Paul M. B. Vitányi, André Souto, Armando B. Matos
Publication date: 19 October 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0809.2546
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Information measures for infinite sequences, Lowness and logical depth, Unpredictability and Computational Irreducibility, Depth, Highness and DNR Degrees, Algorithmic Statistics: Forty Years Later
Cites Work
- Unnamed Item
- Computational depth and reducibility
- Weakly useful sequences
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Recursive computational depth.
- Computational depth: Concept and applications
- The Similarity Metric
- Randomness conservation inequalities; information and independence in mathematical theories