Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
- 1 July 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 284 (2) , 269-277
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A characterization of c.e. random realsTheoretical Computer Science, 2002
- Recursively enumerable reals and Chaitin Ω numbersTheoretical Computer Science, 2001
- Randomness and Recursive EnumerabilitySIAM Journal on Computing, 2001
- Randomness everywhereNature, 1999
- Information, Randomness & Incompleteness1987
- Algorithmic Information Theory1987
- Algorithmic Information TheoryIBM Journal of Research and Development, 1977
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975