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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Chaitin, Gregory J.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Hackensack, N.J. : World Scientific, ©2007.
Temas:
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
Acceso en línea:Texto completo
Descripción
Sumario: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 these ideas, tracing them back to Leibniz and Borel as well as Gödel and Turing. This book contains 23 non-technical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of program-size co.
Descripción Física:1 online resource (xix, 347 pages)
Bibliografía:Includes bibliographical references and index.
ISBN:9789812708977
9812708979
1281918679
9781281918673
9786611918675
6611918671

Ejemplares similares