1. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees;Ambos-Spies;Trans. Amer. Math. Soc.,1984
2. Information Theory and Randomness, an Algorithmic Perspective;Calude,1994
3. C. Calude, R. Coles, P. Hertling, B. Khoussainov, Degree-theoretic aspects of computably enumerable reals, in: Cooper, Truss (Eds.), Models and Computability, Cambridge University Press, Cambridge, 1999.
4. C. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin's Ω number, STACS ’98, Springer Lecture Notes in Computer Science, Vol. 1373, 1998, Springer, Berlin, pp. 596–606.
5. C. Calude, A. Nies, Chaitin's Ω numbers and strong reducibilities, J. Universal Comput. Sci. 1997.