Thinking about Gödel and Turing : essays on complexity 1970-2007 /

Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable O number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of thes...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Chaitin, Gregory J.
Format: Electronic eBook
Language:Inglés
Published: Hackensack, N.J. : World Scientific, ©2007.
Subjects:
Gödel's theorem.
Incompleteness theorems.
Logic, Symbolic and mathematical.
Metamathematics.
Computational complexity.
Théorème de Gödel.
Théorèmes d'incomplétude.
Logique symbolique et mathématique.
Métamathématique.
Complexité de calcul (Informatique)
MATHEMATICS > Infinity.
MATHEMATICS > Logic.
Mathematische Logik
Online Access:Texto completo
Table of Contents:
  • On the Difficulty of Computations; Information-Theoretic Computational Complexity; Randomness and Mathematical Proof; Godel's Theorem and Information; Randomness in Arithmetic; Paradoxes of Randomness; Complexity and Leibniz; The Limits of Reason; How Real Are Real Numbers?; Is Incompleteness a Serious Problem?; How Much Information Can There Be in a Real Number?; and other papers.

Similar Items