Non-approximability of the Randomness Deficiency Function

DOI10.1007/11753728_37MaRDI QIDQ3434710zbMATH OpenOpenAlexFDO

Authors M. A. Ustinov

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_37

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Randomness deficiencies
• scientific article; zbMATH DE number 4041257
• On approximate uncomputability of the Kolmogorov complexity function
• Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
• The combinatorial complexity of a finite string

Cited in

(3)

• Randomness deficiencies
• scientific article; zbMATH DE number 4041257 (Why is no real title available?)
• The combinatorial complexity of a finite string

This page was built for publication: Non-approximability of the Randomness Deficiency Function

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