Randomness and reducibility
- 29 February 2004
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 68 (1) , 96-114
- https://doi.org/10.1016/j.jcss.2003.07.004
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A Kolmogorov complexity characterization of constructive Hausdorff dimensionInformation Processing Letters, 2002
- Presentations of computably enumerable realsTheoretical Computer Science, 2002
- Recursively enumerable reals and chaitin Ω numbersPublished by Springer Nature ,1998
- Incompleteness theorems for random realsAdvances in Applied Mathematics, 1987
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- Cohesive sets and recursively enumerable Dedekind cutsPacific Journal of Mathematics, 1969
- Three approaches to the quantitative definition of information*International Journal of Computer Mathematics, 1968
- Recursive real numbersThe Journal of Symbolic Logic, 1963
- Recursive real numbersProceedings of the American Mathematical Society, 1954