On approximate uncomputability of the Kolmogorov complexity function
From MaRDI portal
Publication:2179366
Recommendations
Cited in
(9)- Non-approximability of the Randomness Deficiency Function
- Kolmogorov Complexity with Error
- Estimates of Kolmogorov complexity in approximating Cantor sets
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- A safe approximation for Kolmogorov complexity
- Randomized communication complexity of approximating Kolmogorov complexity
- Asymptotic density and the coarse computability bound
- Approximating Kolmogorov complexity
- List approximation for increasing Kolmogorov complexity
This page was built for publication: On approximate uncomputability of the Kolmogorov complexity function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179366)