Non-reducible descriptions for conditional Kolmogorov complexity

DOI10.1016/J.TCS.2007.05.019MaRDI QIDQ2382285zbMATH OpenOpenAlexWikidataFDO

Authors A. Shen, Mikhail Ustinov, Michael V. Vyugin, Andrej Muchnik, Nikolai K. Vereshchagin

Publication date 28 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.05.019

zbMATH Keywords

conditional descriptionsConditional Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Theory and Applications of Models of Computation
• Nonreducible descriptions for the conditional Kolmogorov complexity
• Conditional complexity and codes

Cites work

• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• Conditional complexity and codes
• Nonreducible descriptions for the conditional Kolmogorov complexity
• Theory and Applications of Models of Computation

Cited in

(2)

• Nonreducible descriptions for the conditional Kolmogorov complexity
• Theory and Applications of Models of Computation

This page was built for publication: Non-reducible descriptions for conditional Kolmogorov complexity

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