Algorithmic information theory and undecidability

DOI10.1023/A:1005298819345zbMath0971.03003MaRDI QIDQ5926254

Raatikainen, Panu

Publication date: 23 October 2001

Published in: Synthese (Search for Journal in Brave)

zbMATH Keywords

undecidability; algorithmic information theory; Chaitin's theorem

Mathematics Subject Classification ID

03A05: Philosophical and critical aspects of logic and foundations

03D35: Undecidability and degrees of sets of sentences

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

Related Items

ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS, On explicating the concept `the power of an arithmetical theory'