1. Avigad, J., Computability and Incompleteness-Lectures Notes, https://www.andrew.cmu.edu/user/avigad/Teaching/candinotes.pdf, 2007.
2. Calude, C., Information and Randomness—An Algorithmic Perspective, 2nd ed., Springer, Berlin, 2002.
3. Calude, C., and G. Păun, Independent instances for some undecidable problems, RAIRO-Theoretical Informatics and Applications-Informatique Théorique et Applications 17(1):49–54, 1983.
4. Calude, C. S., and S. Rudeanu, Proving as a computable procedure, Fundamenta Informaticae 64(1–4):43–52, 2005.
5. Chaitin, G. J., Computational complexity and Gödel’s incompleteness theorem, ACM SIGACT News 9:11–12, 1971.