Contents
Introductory note
On the difficulty of computations IEEE Transactions on Information Theory, 1970
Information-theoretic computational complexity IEEE Transactions on Information Theory, 1974
Randomness and mathematical proof Scientific American, 1975
Godel's theorem and information International Journal of Theoretical Physics, 1982
Randomness in arithmetic Scientific American, 1988
Randomness in arithmetic and the decline & fall of reductionism in pure mathematics Bulletin of the European Association for Theoretical Computer Science, 1993
A century of controversy over the foundations of mathematics Calude & Paun, Finite versus Infinite, 2000
A century of controversy over the foundations of mathematics Complexity, 2000
Metamathematics and the foundations of mathematics Bulletin of the European Association for Theoretical Computer Science, 2002
Paradoxes of randomness Complexity, 2002
Two philosophical applications of algorithmic information theory Lecture Notes in Computer Science, 2003
On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility Hogrebe & Bromand, Grenzen und Grenz uberschreitungen, 2004
Leibniz, information, math & physics Loer & Weingartner, Wissen und Glauben, 2004
Leibniz, randomness & the halting probability Mathematics Today, 2004
Complexity & Leibniz Acad emie Internationale de Philosophie des Sciences, Tenerife, 2005
The limits of reason Scientific American, 2006
How real are real numbers? International Journal of Bifurcation and Chaos, 2006
Epistemology as information theory: From Leibniz to Collapse: Journal of Philosophical Research and Development, 2006
Is incompleteness a serious problem? Lolli & Pagallo, La complessit a di Godel, 2007
Speculations on biology, information & complexity Bulletin of the European Association for Theoretical Computer Science, 2007
How much information can there be in a real number? International Journal of Bifurcation and Chaos, 2007
The halting probability : Irreducible complexity in pure mathematics Milan Journal of Mathematics, 2007
The halting probability : Concentrated creativity Obrist, Formulas for the Twenty-First Century, 2007
List of publications
Acknowledgements
About the author

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription

No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn how to download books offline

We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1.5 million books across 990+ topics, we’ve got you covered! Learn about our mission

Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more about Read Aloud

Yes! You can use the Perlego app on both iOS and Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app

Yes, you can access Thinking About Godel And Turing: Essays On Complexity, 1970-2007 by Gregory J Chaitin in PDF and/or ePUB format, as well as other popular books in Biological Sciences & Science General. We have over 1.5 million books available in our catalogue for you to explore.

Trusted by 375,005 students

Information

Table of contents

Frequently asked questions