1. The complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set;Barzdin';Soviet Math. Dokl.,1968
2. On random and hard-to-describe numbers;Bennett,1979
3. A theory of program-size formally identical to information theory;Chaitin;J. ACM,1975
4. On the symmetry of algorithmic information;Gács;Soviet Math. Dokl.,1974
5. Exact expressions for some randomness tests;Gács;Z. Math. Logik. Grundl. Math.,1980