Non-reducible descriptions for conditional Kolmogorov complexity

DOI10.1016/J.TCS.2007.05.019zbMATH Open1124.68049OpenAlexW2475839174WikidataQ57349757 ScholiaQ57349757MaRDI QIDQ2382285FDOQ2382285

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

Recommendations

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

zbMATH Keywords

conditional descriptionsConditional Kolmogorov complexity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Nonreducible descriptions for the conditional Kolmogorov complexity
• Conditional complexity and codes
• 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)