Algorithmic information theory and undecidability
From MaRDI portal
Publication:5926254
DOI10.1023/A:1005298819345zbMath0971.03003MaRDI QIDQ5926254
Publication date: 23 October 2001
Published in: Synthese (Search for Journal in Brave)
Philosophical and critical aspects of logic and foundations (03A05) Undecidability and degrees of sets of sentences (03D35) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (2)
On explicating the concept `the power of an arithmetical theory' ⋮ ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS
This page was built for publication: Algorithmic information theory and undecidability