1. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. In: Proceedings of the Twenty-First Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, pp. 632–643. Springer, Heidelberg (2004)
2. Barzdin, J.M.: Complexity of programs which recognize whether natural numbers not exceeding n belong to a recursively enumerable set. Sov. Math., Dokl. 9, 1251–1254 (1968)
3. Cai, J.-Y., Hartmanis, J.: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. J. Comput. System Sci. 49(3), 605–619 (1994)
4. Downey, R.G., Griffiths, E.J.: Schnorr randomness. J. Symbolic Logic 69(2), 533–554 (2004)
5. Downey, R.G., Hirschfeldt, D.R.: Algorithmic randomness and complexity. book (2004) (in preparation)