1. [17] Lachlan Alistair H. , Lower bounds for pairs of recursively enumerable degrees. Proceedings of the London Mathematical Society , vol. 16 (1966), pp. 537–569.
2. [2] Barmpalias George , On strings with trivial Kolmogorov complexity. International Journal of Software and Informatics , vol. 5(2011), no. 4, pp. 609–623.
3. [9] Calude Christian , Hertling Peter , Khoussainov Bakhadyr , and Wang Yongge , Recursively enumerable reals and Chaitin Ω numbers, Theoretical Computer Science , vol. 255 (2001), no. (1–2), pp. 125–149.
4. [7] Barmpalias George and Nies André , Upper bounds on ideals in the computably enumerable turing degrees. Annals of Pure and Applied Logic , vol. 162 (2011), no. 6, pp. 465–473.
5. [29] Solovay Robert , Handwritten manuscript related to Chaitin’s work, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1975, p. 215.