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

Bruno Bauwens. Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, editors, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Volume 7391 of Lecture Notes in Computer Science, pages 100-108, Springer, 2012. [doi]

Abstract

Abstract is missing.