On Characteristic Constants of Theories Defined by Kolmogorov Complexity

DOI10.1007/978-3-540-69937-8_19zbMath1156.03044OpenAlexW1523156221MaRDI QIDQ3511460

Makoto Kikuchi, Hirotaka Kikyo, Shingo Ibuka

Publication date: 10 July 2008

Published in: Logic, Language, Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69937-8_19

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Cites Work

• Unnamed Item
• On interpreting Chaitin's incompleteness theorem
• Algorithmic information theory
• Information-Theoretic Limitations of Formal Systems

This page was built for publication: On Characteristic Constants of Theories Defined by Kolmogorov Complexity