Chaitin Gregory J Chaitin – författare
Visar alla böcker från författaren Chaitin Gregory J Chaitin. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
E-bok
PDF, Engelska, 2007831 kr
Läs direkt efter köp
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.
E-bok
PDF, Engelska, 1992530 kr
Läs direkt efter köp
In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a nontechnical discussion of its significance. The volume is an essential companion to the earlier collection of Chaitin''s papers Information, Randomness and Incompleteness, also published by World Scientific.The technical survey contains many new results, including a detailed discussion of LISP program size and new versions of Chaitin''s most fundamental information-theoretic incompleteness theorems. The nontechnical part includes the lecture given by Chaitin in Gšdel''s classroom at the University of Vienna, a transcript of a BBC TV interview, and articles from New Scientist, La Recherche, and the Mathematical Intelligencer.
E-bok
PDF, Engelska, 1987737 kr
Läs direkt efter köp
The papers gathered in this book were published over a period of more than twenty years in widely scattered journals. They led to the discovery of randomness in arithmetic which was presented in the recently published monograph on “Algorithmic Information Theory” by the author. There the strongest possible version of Gödel''s incompleteness theorem, using an information-theoretic approach based on the size of computer programs, was discussed. The present book is intended as a companion volume to the monograph and it will serve as a stimulus for work on complexity, randomness and unpredictability, in physics and biology as well as in metamathematics.