Latest Publications

An algebraic characterization of the halting probability
CDMTCS Research Report, April 2007
Speculations on biology, information and complexity
EATCS Bulletin, February 2007
Algorithmic information theory: Some recollections
arXiv.org, January 2007
How much information can there be in a real number?
CDMTCS Research Report, January 2007
The halting probability Ω: irreducible complexity in pure mathematics
Milan Journal of Mathematics, December 2006
Meta Math!
Paperback edition, November 2006
Meta Maths
Atlantic Books, November 2006
Teoria algoritmica della complessità
Giappichelli, October 2006
C. Calude, G. Chaitin:
A dialogue on mathematics & physics
EATCS Bulletin, October 2006
Epistemology as information theory: from Leibniz to Ω
Collapse, September 2006
Is incompleteness a serious problem?
CDMTCS Research Report, July 2006
How real are real numbers?
International Journal of Bifurcation and Chaos, June 2006
Probability and program-size for functions
Fundamenta Informaticae, June 2006
The limits of reason
Scientific American, March 2006
Three lectures
Valparaiso, January 2006
Algorithmic irreducibility in a cellular automata universe
J.UCS, 2005
Complexity & Leibniz
Tenerife, 2005
Omega and why mathematics has no "theories of everything"
Plus, 2005
Meta Math!
Pantheon, 2005
Algorithmic Information Theory
Paperback edition, 2004
Leibniz, information, math and physics
Löffler, Weingartner, Wissen und Glauben, 2004
(pdf version)
Leibniz, randomness & the halting probability
Mathematics Today, 2004
On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility
Hogrebe, Bromand, Grenzen und Grenzüberschreitungen, 2004
(pdf version)
Turkish translation of A century of controversy over the foundations of mathematics
Gür, Matematik Felsefesi, 2004
Grenzen der Berechenbarkeit
Spektrum der Wissenschaft, 2004
Thoughts on the Riemann hypothesis
The Mathematical Intelligencer, 2004
L'univers est-il intelligible?
La Recherche, 2003
(html version)
Portuguese translation of Conversations with a Mathematician
Gradiva, 2003
Interview with performance artist Marina Abramovic
Obrist, Interviews, 2003
From Philosophy to Program Size
Tallinn Institute of Cybernetics, 2003
Japanese translation of Conversations with a Mathematician
Iwanami Shoten, 2003
Two philosophical applications of algorithmic information theory
Proceedings DMTCS'03, 2003
(pdf version)
Ordenadores, paradojas y fundamentos de las matemáticas
Investigación y Ciencia, 2003
Randomness and mathematical proof
Gregersen, From Complexity to Life, 2003
The unknowable
Miyake, Obrist, Bridge the Gap?, 2002
Complexité, logique et hasard
Benkirane, La Complexité, 2002
Meta-mathematics and the foundations of mathematics
EATCS Bulletin, 2002
(pdf version)
[Italian translation: Fondamenti della matematica e teoria algoritmica
dell'informazione, in Enciclopedia del Novecento: Supplemento III,
volume H-W, 2004, pages 111-116.]
Paradoxes of randomness
Complexity, 2002
(pdf version)
Computers, paradoxes and the foundations of mathematics
American Scientist, 2002
(html version)
[In Spanish. In German.]
Conversations with a Mathematician
Springer-Verlag, 2002
Japanese translation of The Unknowable
SIB-Access, 2001
Exploring Randomness (Corrected 2nd printing)
Springer-Verlag, 2001
Japanese translation of The Limits of Mathematics
SIB-Access, 2001
Italian translation of A century of controversy over the foundations of mathematics
Manca, Logica matematica, 2001
Exploring Randomness
Springer-Verlag, 2001
(with Java applet LISP interpreter)
A century of controversy over the foundations of mathematics
Complexity, 2000
(pdf version)
[Spanish translation prepared by Andres Becerra Sandoval,
estudiante de la Universidad del Valle - Colombia]
A century of controversy over the foundations of mathematics
Calude & Paun, Finite vs. Infinite, 2000
[Turkish translation prepared by Bekir S. Gür]
Hasard et imprévisibilité des nombres
La Recherche, 1999
Calude, Chaitin, Randomness everywhere
Nature, 1999
The Unknowable
Springer-Verlag, 1999
(with Java applet LISP interpreter)
Elegant LISP programs
Calude, People & Ideas in Theoretical Computer Science, 1999
The Limits of Mathematics
Springer-Verlag, 1998
(with Java applet LISP interpreter)
Gödel's theorem and information
Information-theoretic computational complexity
Tymoczko, New Directions in the Philosophy of Mathematics, 1998
An invitation to algorithmic information theory
DMTCS'96 Proceedings, 1997
The limits of mathematics
J.UCS, 1996
How to run algorithmic information theory on a computer
Complexity, 1996
A new version of algorithmic information theory
Complexity, 1996
Randomness in arithmetic and the decline & fall of reductionism in pure mathematics
Cornwell, Nature's Imagination, 1995
The Berry paradox
Complexity, 1995
Program-size complexity computes the halting problem
EATCS Bulletin, 1995
Responses to "Theoretical mathematics: Toward a cultural synthesis of mathematics and theoretical physics'', by A. Jaffe and F. Quinn
AMS Bulletin, 1994
Randomness in arithmetic and the decline & fall of reductionism in pure mathematics
EATCS Bulletin, 1993
[traduction française]
On the number of n-bit strings with maximum complexity
Applied Mathematics & Computation, 1993
A random walk in arithmetic
Hall, Exploring Chaos, 1993
Hall, The New Scientist Guide to Chaos, 1992