Axiomatizing Kolmogorov Complexity
Tóm tắt
We revisit the axiomatization of Kolmogorov complexity given by Alexander Shen, currently available only in Russian language. We derive an axiomatization for conditional plain Kolmogorov complexity. Next we show that the axiomatic system given by Shen cannot be weakened (at least in any natural way). In addition we prove that the analogue of Shen’s axiomatic system fails to characterize prefix-free Kolmogorov complexity.
Tài liệu tham khảo
Chaitin, G.J.: On the length of programs for computing finite binary sequences. J. ACM 13(4), 547–569 (1966)
Downey, R.G., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)
Kolmogorov, A.N.: Three approaches to the definition of the concept “quantity of information”. Probl. Pereda. Inf. 1, 3–11 (1965)
Muchnik, A.A., Mezhirov, I., Shen, A., Vereshchagin, N.: Game interpretation of Kolmogorov complexity. Draft Version (2010)
Shen, A.: Axiomatic description of the entropy notion for finite objects. In: VIII All-USSR Conference “Logika i Metodologija Nauki”. Vilnius (1982). Paper in Russian
Uspensky, V.A., Shen, A., Vereshchagin, N.K.: Kolmogorov Complexity and Randomness. Book draft version (2010)