References
- Claude , C. and Chitescu , I. 1983 . Strong noncomputability of random strings . Intern. Journal Computer Math , 11 : 43 – 45 .
- Kolmogorov , A.N. 1968 . “ Three approaches to the concept of the amount of information ” . In Selected Translations in Mathematical Statistics and Probability , Vol. 7 , 293 – 302 . American Math. Soc .
- Rogers , H. Jr . 1967 . The Theory of Recursive Functions and Effective Computability , New York : McGraw-Hill .
- Zvonkin , A. and Levin , L. 1970 . The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms . Russian Math. Surveys , 25 ( 6 ) : 83 – 124 .