Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity

DOI10.1007/978-3-642-31594-7_9zbMATH Open1272.68163OpenAlexW1700912722MaRDI QIDQ2843239FDOQ2843239

Authors: B. Bauwens 

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_9

Recommendations

• Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
• Relating and contrasting plain and prefix Kolmogorov complexity
• Kolmogorov complexity and solovay functions
• Kolmogorov complexity conditional to large integers
• Information distance and conditional complexities

Mathematics Subject Classification ID

Applications of game theory (91A80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (4)

• An additivity theorem for plain Kolmogorov complexity
• Relating and contrasting plain and prefix Kolmogorov complexity
• Logical Approaches to Computational Barriers
• Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity

This page was built for publication: Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity

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