Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
From MaRDI portal
Publication:1607291
DOI10.1016/S0304-3975(01)00068-8zbMath1042.68045WikidataQ57001702 ScholiaQ57001702MaRDI QIDQ1607291
Publication date: 31 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Selection by Recursively Enumerable Sets, Computing a Glimpse of Randomness, From Heisenberg to Gödel via Chaitin, From Heisenberg to Gödel via Chaitin, Simplicity via provability for universal prefix-free Turing machines, Is complexity a source of incompleteness?, EXACT APPROXIMATIONS OF OMEGA NUMBERS, Information: The Algorithmic Paradigm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- Presentations of computably enumerable reals.
- Randomness and Recursive Enumerability
- Algorithmic Information Theory
- A Theory of Program Size Formally Identical to Information Theory
- Algorithmic Information Theory
- A characterization of c. e. random reals