1. , and , A highly random number. In: Proceedings of the Third Discrete Mathematics and Theoretical Computer Science Conference (C. S. Calude, M. J. Dineen, and S. Sburlan, eds.), pp. 55–68 (Springer, 2001).
2. Kolmogorov Complexity for Possibly Infinite Computations
3. Information-theoretic characterizations of recursive infinite strings
4. A Set of Postulates For the Foundation of Logic
5. and , Church, cardinal and ordinal representations of integers and Kolmogorov complexity. In: Denis Richard's 60th Birthday, 2002, Université Clermont II, France, pp. 1–16 (2002).