Thinking About Godel And Turing: Essays On Complexity, 1970-2007
Regular price
€184.76
A01=Gregory J Chaitin
Algorithmic Information Theory
Author_Gregory J Chaitin
Category=PBB
Complexity
Digital Philosophy
Epistemology
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Experimental Mathematics
Foundations of Mathematics
GAfA?del Incompleteness Theorem
Godel Incompleteness Theorem
Gödel Incompleteness Theorem
Halting Probability Omega
Incompleteness
Information-Theoretic Computational Complexity
Irreducible Complexity
Program-Size Complexity
Quasi-empirical View of Mathematics
Random Real Numbers
Uncomputability
Uncomputable Real Numbers
Product details
- ISBN 9789812708953
- Publication Date: 08 Aug 2007
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable Ω 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 complexity or algorithmic information content in order to shed further light on the fundamental work of Gödel and Turing on the limits of mathematical methods, both in logic and in computation. Chaitin argues here that his information-theoretic approach to metamathematics suggests a quasi-empirical view of mathematics that emphasizes the similarities rather than the differences between mathematics and physics. He also develops his own brand of digital philosophy, which views the entire universe as a giant computation, and speculates that perhaps everything is discrete software, everything is 0's and 1's.Chaitin's fundamental mathematical work will be of interest to philosophers concerned with the limits of knowledge and to physicists interested in the nature of complexity.
