Abstract
Chaitin discovered that for each formal system T, there exists a constant c such that no sentence of the form K(x) > c is provable in T, where K(x) is the Kolmogorov complexity of x. We call the minimum such c the Chaitin characteristic constant of T, or c T . There have been discussions about whether it represents the information content or strength of T. Raatikainen tried to reveal the true source of c T , stating that it is determined by the smallest index of Turing machine which does not halt but we cannot prove this fact in T. We call the index the Raatikainen characteristic constant of T, denoted by r T . We show that r T does not necessarily coincide with c T ; for two arithmetical theories T, T′ with a Π 1-sentence provable in T′ but not in T, there is an enumeration of the Turing machines such that r T < r T′ and c T = c T′ .
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Chaitin, G.J.: Information-theoretic limitations of formal systems. Journal of the ACM 21, 403–424 (1974)
van Lambalgen, M.: Algorithmic information theory. Journal of Symbolic Logic Logic 54, 1389–1400 (1989)
Raatikainen, P.: On interpreting Chaitin’s incompleteness theorem. Journal of Philosophical Logic 27(6), 569–586 (1998)
Solovay, R.M.: A Version of Ω for Which ZFC Can Not Predict A Single Bit. CDMTCS-104 (1999)
Vitanyi, P., Li, M.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibuka, S., Kikuchi, M., Kikyo, H. (2008). On Characteristic Constants of Theories Defined by Kolmogorov Complexity. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-69937-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69936-1
Online ISBN: 978-3-540-69937-8
eBook Packages: Computer ScienceComputer Science (R0)