Export directly to RefWorks

TY  - BOOK
ID  - 77944217
TI  - Thinking about Godel and Turing : essays on complexity, 1970-2007
PY  - 2007
SN  - 1281918679 9786611918675 9812708979 9789812708977 9789812708960 9812708960 9789812708953 9812708952
PB  - Singapore ; Hackensack, NJ : World Scientific,
DB  - UniCat
KW  - Godel's theorem.
KW  - Incompleteness theorems.
KW  - Logic, Symbolic and mathematical.
KW  - Metamathematics.
KW  - Computational complexity.
KW  - Algebra of logic
KW  - Logic, Universal
KW  - Mathematical logic
KW  - Symbolic and mathematical logic
KW  - Symbolic logic
KW  - Mathematics
KW  - Algebra, Abstract
KW  - Metamathematics
KW  - Set theory
KW  - Syllogism
KW  - Theorems, Incompleteness
KW  - Constructive mathematics
KW  - Proof theory
KW  - Complexity, Computational
KW  - Electronic data processing
KW  - Machine theory
KW  - Logic, Symbolic and mathematical
KW  - Gödel's incompleteness theorem
KW  - Undecidable theories
KW  - Arithmetic
KW  - Completeness theorem
KW  - Incompleteness theorems
KW  - Number theory
KW  - Decidability (Mathematical logic)
KW  - Philosophy
KW  - Foundations
UR  - https://www.unicat.be/uniCat?func=search&query=sysid:77944217
AB  - 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 Gö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
ER  -