| Publication | Date of Publication | Type |
|---|
| Leibniz, randomness \& the halting probability | 2024-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5100778 | 2022-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5072478 | 2022-04-28 | Paper |
| An Experiment in Autobiography | 2021-06-15 | Paper |
| Unknowability in Mathematics, Biology and Physics | 2021-06-15 | Paper |
| Conceptual Complexity and Algorithmic Information | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2961443 | 2017-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2801553 | 2016-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2801557 | 2016-04-20 | Paper |
| Life as Evolving Software | 2013-02-26 | Paper |
| How Much Information Can There Be in a Real Number? | 2012-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224081 | 2012-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224113 | 2012-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3102754 | 2011-11-25 | Paper |
| Thoughts on the Riemann hypothesis | 2010-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5188221 | 2010-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396613 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601842 | 2009-02-12 | Paper |
| A new version of algorithmic information theory. | 2008-12-21 | Paper |
| HOW MUCH INFORMATION CAN THERE BE IN A REAL NUMBER? | 2008-07-02 | Paper |
| The halting probability Omega: irreducible complexity in pure mathematics | 2008-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5448320 | 2008-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422265 | 2007-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310877 | 2007-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5756952 | 2007-09-06 | Paper |
| The Omega Number: Irreducible Complexity in Pure Math | 2007-09-05 | Paper |
| HOW REAL ARE REAL NUMBERS? | 2007-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5482595 | 2006-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4469353 | 2004-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452085 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431358 | 2003-10-21 | Paper |
| Gödel's theorem and information | 2003-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799352 | 2003-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796282 | 2003-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152803 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757284 | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752143 | 2001-10-21 | Paper |
| Paradoxes of Randomness | 2001-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2709403 | 2001-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520330 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942040 | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4522700 | 2001-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263940 | 2000-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259438 | 1999-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217578 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395604 | 1998-08-04 | Paper |
| The Berry paradox | 1998-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4376935 | 1998-02-16 | Paper |
| RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS | 1997-11-27 | Paper |
| Randomness in arithmetic and the decline and fall of reductionism in pure mathematics | 1995-11-13 | Paper |
| Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn | 1994-08-14 | Paper |
| A note on the number of \(N\)-bit strings with maximum complexity | 1994-03-14 | Paper |
| Information-Theoretic Incompleteness | 1993-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995518 | 1993-01-23 | Paper |
| Information-theoretic incompleteness | 1993-01-17 | Paper |
| LISP program-size complexity. II | 1993-01-17 | Paper |
| LISP program-size complexity. III | 1993-01-17 | Paper |
| LISP program-size complexity. IV | 1993-01-17 | Paper |
| LISP program-size complexity | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495265 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809785 | 1988-01-01 | Paper |
| Incompleteness theorems for random reals | 1987-01-01 | Paper |
| Algorithmic Information Theory | 1987-01-01 | Paper |
| A note on monte carlo primality tests and algorithmic information theory | 1978-01-01 | Paper |
| Program size, oracles, and the jump operation | 1977-01-01 | Paper |
| Algorithmic Information Theory | 1977-01-01 | Paper |
| Information-theoretic characterizations of recursive infinite strings | 1976-01-01 | Paper |
| Algorithmic entropy of sets | 1976-01-01 | Paper |
| A Theory of Program Size Formally Identical to Information Theory | 1975-01-01 | Paper |
| Information-theoretic computation complexity | 1974-01-01 | Paper |
| Information-Theoretic Limitations of Formal Systems | 1974-01-01 | Paper |
| On the difficulty of computations | 1970-01-01 | Paper |
| On the Length of Programs for Computing Finite Binary Sequences | 1969-01-01 | Paper |
| On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers | 1969-01-01 | Paper |
| On the Length of Programs for Computing Finite Binary Sequences | 1966-01-01 | Paper |
| On the Bound to the Memory of a Sequential Machine | 1965-01-01 | Paper |
