On a theorem of gács

References

• Calude C. Elementary Algorithmic Information Theory Springer-Verlag 1991 90 Lecture Notes, Bucharest
   Google Scholar
• Calude , C. and Chijescu , I. 1988 . Random sequences: Some topological and measure-theoretical properties . An. Univ. Bucuresti, Mat.-Inf. , 2 : 27 – 32 .
   Google Scholar
• Gács , P. 1986 . Every sequence is reducible to a random one . Inform. and Control , 70 : 186 – 192 .
   Google Scholar
• Li , M. and Vitányi , P. M. 1990 . “ Kolmogorov complexity and its application ” . In Handbook of Theoretical Computer Science , Edited by: van Leeuwen , J. 189 – 254 . Cambridge, Massachusetts : The MIT Press . Elsevier, Amsterdam
   Google Scholar
• Martin-Löf , P. 1966 . The definition of random sequences . Inform. and Control , 9 : 602 – 619 .
   Google Scholar
• Weihrauch , K. 1987 . Computability , Berlin : Springer-Verlag .
   Google Scholar