Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity

DOI10.1007/978-3-642-31594-7_9zbMath1272.68163OpenAlexW1700912722MaRDI QIDQ2843239

Bruno 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

Mathematics Subject Classification ID

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

This page was built for publication: Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity