Recursively enumerable reals and chaitin Ω numbers
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 596-606
- https://doi.org/10.1007/bfb0028594
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Computational depth and reducibilityTheoretical Computer Science, 1994
- Information and RandomnessPublished by Springer Nature ,1994
- Complexity Theory of Real FunctionsPublished by Springer Nature ,1991
- Information, Randomness & IncompletenessPublished by World Scientific Pub Co Pte Ltd ,1987
- Varieties of Constructive MathematicsPublished by Cambridge University Press (CUP) ,1987
- Measure, Π 1 0 -classes and complete extensions of PALecture Notes in Mathematics, 1985
- Mathematical GamesScientific American, 1979
- Algorithmic Information TheoryIBM Journal of Research and Development, 1977
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966