• The book Theories of Computational Complexity is used at Asian Institute of Technology for the course AT02.20 Theory of Computation , for the courses Complejidad Algoritmica Modelos de Informatica Teorica and Introduccion a la complejidad algoritmica at Universidad De Granada, the course Symbolische Mathematik in der Theoretischen Physik by Karin Seifert-Lorenz, Christoph F. Strnadl, Andreas Eichler.
• The book Information and Randomness is used for the following courses: at the University of Ulm by Prof. Dr. U. Schöning, at Martin-Luther-Universität Halle-Wittenberg by Prof. Dr. L. Staiger, Theoretische Informatik 2"  at the University of Potsdam by Prof. Dr. H. Jürgensen, Information and Coding Theory at the Universitat Politecnica de Valencia,Spain, by Prof. J. M. Sempere, LOG6: Complexité et combinatoire at University of Nice Sophia Antipolis, France by Igor Litovsky and Bruno Martin.
• The book Computing with Cells and Atoms is used for the courses "COMP 4/6601: Models of Computation", The University of Memphis, USA , "Introduction to Quantum Computing (M743)", Indiana University, USA , "06-12411 Introduction to Molecular and Quantum Computation", The University of Birmingham, UK , Seminar "Bits und Zellen", Hamburg University, Germany, Bioinformatics and Biocomputing, Seoul National University, Korea.
• Stanford University at "Papers and Books for CS 446 and Beyond''.
• Opinions on the second edition of the book Information and Randomness, Springer-Verlag, Heidelberg, 2002:
  • "Professor Calude has produced a first-rate exposition of up-to-date work in information and randomness." D.S. Bridges, Canterbury University, co-author, with Errett Bishop, of Constructive Analysis
  • "The second edition of this classic work is highly recommended to anyone interested in algorithmic information and randomness." G.J. Chaitin, IBM Research Division, New York, author of Conversations with a Mathematician
  • "An excellent introduction to the area". A. Salomaa, Computing Reviews CR129192 (0408-0957).
  • "This book is a must for a comprehensive introduction to algorithmic information theory and for anyone interested in its applications in the natural sciences." K. Svozil, Technical University of Vienna, author of Randomness & Undecidability in Physics
  
  
• "A good review and comparison of molecular, quantum and membrane computing can be found in Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing by Cristian S. Calude and Gheorghe Paun [22]." In Introduction to Quantum Computing (M743) , p. 23, by Zdzislaw Meglicki, Department of Mathematics at Indiana University, April 2, 2002.


• MathWorld citations: Almost all real numbers are lexicons, Chaitin's Constant and Bead-Sort.


• Wikipedia citations: Chaitin's Constant; see also Dictionary of Computer Science


• Y. Amaya. Characterization of Chaitin Machine Satisfying the Algorithmic Coding Theorem, Masters Thesis, Japan Advanced Institute of Science and Technology, Japan, February 2001.
• P. Andreasen. Universal Source Coding, Masters Thesis, Department of Mathematics, University of Copenhagen, Denmark, July 2001.
• G. Segre. Algorithmic Information Theoretic Issues in Quantum Mechanics, PhD Thesis, Departement of Theoretical Physics, University of Geneva, Swizerland, October 2001.
• M. Lipponen matematiikan väitöskirja vuoden 1996 paras Nevanlina-palkinto turkulaistutkijale, Turum Sanomat, 22 April 1998, p. 11.
• Standford University: Papers and Books for CS 446 and Beyond
• Informationswissenschaftliche elektronische Zeitschriften
• References to Quantum Computers; see also CERN
• A bibliography on primality testing
• E-journals in science
• Nagoya selected home-page
• A Bibliography on the Busy Beaver Problem
• J. Bacon's home-page.
• Olivier J. Bousquet "Kolmogorov complexity resources" .
• Erick Winfree Molecular Computation page.
• University of Macedonia, Department of Applied Informatics: Complex Systems Researchers.
• Shikano Lab database.
• Data Mining and Knowledge Discovery in Databases - Business Applications.
• H. Velasco. The objects of meaning. From the limits of logic.
• Entropy in Logic and the Theory of Algorithms.
• P. Frisco's Bibliography of Molecular Computation and Splicing Systems .
• Selected JACM citations.
• Selected Information and Computation citations.
• Lab 333, EE, NTU, Taiwan, bibliography on zero-knowledge.
• Yonezawa Lab's WWW server, at the Department of Information Science of the University of Tokyo, bibliography in quantum computation.
• I. Shmulevich, D.-J. Povel. Complexity measures of musical rhythms.
• Presented in The Royal Society of New Zeland Science Digest (Science and Technology Alert 25), 17 April 1998.
• L. Hemaspaandra and M. Ogihara. Reductions, Resources, and Robustness.
• M. Gass' home-page.
• Mathematics in New Zealand: Past, Present and Future.
• Y. Matiyasevich "Hilbert's tenth problem" book.
• People at Dyade.
• P. Cholak's bibliography on computability theory at
• Wolfram MathGroup.
• David Dowe's Minimum Encoding Length Inference page.
• Information theory.
• Applications, Interactions, and Connections, of Results and Methods From Core ("Pure") Computability Theory (C.C.T).
• Frank's Molecular Computation page.
• Andrea Sorbi's computability page.
• Links to people and ideas.
• Bibliography collected by L.M. Gluskin, Part I.
• Jean-Paul Davalan : Alan Turing Page
• Citations of Calude-Stay. From Heisenberg to Goedel via Chaitin: Quantum Computing SIG, Research in Quantum Computing and Information


• N. J. A. Sloane's people


• Michael Trott. Mathematica GuideBooks, Springer, 2004.


• Petrus H. Potgieter's talk: Topological aspects of the "random" sequences: The set of Kolmogorov-Chaitin-Solomonoff complex (KCSC) sequences is small in category in Cantor space but Calude-Marcus-Staiger have recently given a metric topology in which the set of KCSC sequences is in fact co-meagre


• Included with the paper "From Heisenberg to Goedel via Chaitin" (with M.A. Stay) in the CERN list of most downloaded papers of year 2004