• Title: The Limits of Mathematics: A Course on Information Theory and the Limits of Formal Reasoning
• Author(s) Gregory J. Chaitin
• Publisher: Springer; 1 edition (November 14, 1997); eBook (Creative Commons Licensed)
• License(s): CC BY-NC-ND 4.0
• Hardcover/Paperback: 148 pages
• eBook: PDF, ePub, Kindle, etc.
• Language: English
• ISBN-10: 981308359X
• ISBN-13: 978-9813083592
• Share This:  

Book Description

This book is the final version of a course on algorithmic information theory and the epistemology of mathematics and physics. It discusses Einstein and Goedel's views on the nature of mathematics in the light of information theory, and sustains the thesis that mathematics is quasi-empirical. There is a foreword by Cris Calude of the University of Auckland, and supplementary material is available at the author's web site.

The special feature of this book is that it presents a new "hands on" didatic approach using LISP and Mathematica software. The reader will be able to derive an understanding of the close relationship between mathematics and physics. "The Limits of Mathematics is a very personal and idiosyncratic account of Greg Chaitin's entire career in developing algorithmic information theory.

• N/A

• Amazon

• Information Theory and Systems
• General and Miscellaneous Mathematics
• LISP and Common LISP Programming
• Artificial Intelligence, Machine Learning, and Logic Programming
• Prolog Programming
• Computer and Programming Languages

• The Limits of Mathematics (Gregory J. Chaitin)
• The Mirror Site (1) - PDF

• The Limits Of Science (Nicholas Rescher)

  This book explores in detail the existence of limits or limitations on scientific inquiry, especially those that, in principle, preclude the full realization of the aims of science, as opposed to those that relate to economic obstacles to scientific progress.

• Mathematics in the Age of the Turing Machine (Thomas C. Hales)

  Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.

• What is Mathematics: Godel's Theorem and Around (K. Podnieks)

  This accessible book gives a new, detailed and elementary explanation of the Godel incompleteness theorems and presents the Chaitin results and their relation to the da Costa-Doria results, which are given in full, but with no technicalities.

• Incompleteness and Computability: Gödel's Theorems

  This book is an introduction to metamathematics and Gödel's Theorems. It covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

• Exploring Randomness (Gregory J. Chaitin)

  This book presents the technical core of the theory of program-size complexity. LISP is used to present the key algorithms and to enable computer users to interact with the authors proofs and discover for themselves how they work.

• Introduction to Mathematical Philosophy (Bertrand Russell)

  Requiring neither prior knowledge of mathematics nor aptitude for mathematical symbolism, the book serves as essential reading for anyone interested in the intersection of mathematics and logic and in the development of analytic philosophy.

• Computability, Unsolvability, Randomness (Stephen G. Simpson)

  The author exposits Turing's 1936 theory of computability and unsolvability, as subsequently developed by Kleene and Post. This theory is of the essence in theoretical computer science and in the study of unsolvable mathematical problems.