The Normalized Algorithmic Information Distance Can Not Be Approximated
From MaRDI portal
Publication:5042235
Cites work
- scientific article; zbMATH DE number 3492569 (Why is no real title available?)
- scientific article; zbMATH DE number 7650931 (Why is no real title available?)
- An introduction to Kolmogorov complexity and its applications
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
- Information distance
- Kolmogorov Complexity and Algorithmic Randomness
- Nonapproximability of the normalized information distance
- Normalized information distance and the oscillation hierarchy
Cited in
(2)
This page was built for publication: The Normalized Algorithmic Information Distance Can Not Be Approximated
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042235)