Depth as randomness deficiency
From MaRDI portal
Publication:733740
DOI10.1007/s00224-009-9171-0zbMath1183.68317DBLPjournals/mst/AntunesMSV09arXiv0809.2546OpenAlexW2099307356WikidataQ62038791 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
Related Items (5)
Unpredictability and Computational Irreducibility ⋮ Lowness and logical depth ⋮ Depth, Highness and DNR Degrees ⋮ Algorithmic Statistics: Forty Years Later ⋮ Information measures for infinite sequences
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
This page was built for publication: Depth as randomness deficiency
