You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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 Gdel 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...
This essential companion to Chaitins highly successful The Limits of Mathematics, gives a brilliant historical survey of important work on the foundations of mathematics. The Unknowable is a very readable introduction to Chaitins ideas, and includes software (on the authors website) that will enable users to interact with the authors proofs. "Chaitins new book, The Unknowable, is a welcome addition to his oeuvre. In it he manages to bring his amazingly seminal insights to the attention of a much larger audience His work has deserved such treatment for a long time." JOHN ALLEN PAULOS, AUTHOR OF ONCE UPON A NUMBER
This essential companion to Chaitin's successful books The Unknowable and The Limits of Mathematics, presents the technical core of his theory of program-size complexity. The two previous volumes are more concerned with applications to meta-mathematics. LISP is used to present the key algorithms and to enable computer users to interact with the authors proofs and discover for themselves how they work. The LISP code for this book is available at the author's Web site together with a Java applet LISP interpreter. "No one has looked deeper and farther into the abyss of randomness and its role in mathematics than Greg Chaitin. This book tells you everything hes seen. Don miss it." John Casti, Santa Fe Institute, Author of Goedel: A Life of Logic.'
The book is a collection of papers written by a selection of eminent authors from around the world in honour of Gregory Chaitin's 60th birthday. This is a unique volume including technical contributions, philosophical papers and essays.
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
The revolutions that Gregory Chaitin brought within the fields of science are well known. From his discovery of algorithmic information complexity to his work on Gödel's theorem, he has contributed deeply and expansively to such diverse fields.This book attempts to bring together a collection of articles written by his colleagues, collaborators and friends to celebrate his work in a festschrift. It encompasses various aspects of the scientific work that Chaitin has accomplished over the years. Topics range from philosophy to biology, from foundations of mathematics to physics, from logic to computer science, and all other areas Chaitin has worked on.It also includes sketches of his personality with the help of biographical accounts in some unconventional articles that will provide a rare glimpse into the personal life and nature of Chaitin.Compared to the other books that exist along a similar vein, this book stands out primarily due to its highly interdisciplinary nature and its scope that will attract readers into Chaitin's world.
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 Gdel'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.
Gregory Chaitin, one of the world’s foremost mathematicians, leads us on a spellbinding journey, illuminating the process by which he arrived at his groundbreaking theory. Chaitin’s revolutionary discovery, the Omega number, is an exquisitely complex representation of unknowability in mathematics. His investigations shed light on what we can ultimately know about the universe and the very nature of life. In an infectious and enthusiastic narrative, Chaitin delineates the specific intellectual and intuitive steps he took toward the discovery. He takes us to the very frontiers of scientific thinking, and helps us to appreciate the art—and the sheer beauty—in the science of math.
Groundbreaking mathematician Gregory Chaitin gives us the first book to posit that we can prove how Darwin’s theory of evolution works on a mathematical level. For years it has been received wisdom among most scientists that, just as Darwin claimed, all of the Earth’s life-forms evolved by blind chance. But does Darwin’s theory function on a purely mathematical level? Has there been enough time for evolution to produce the remarkable biological diversity we see around us? It’s a question no one has yet answered—in fact, no one has even attempted to answer it until now. In this illuminating and provocative book, Gregory Chaitin argues that we can’t be sure evolution makes sense wi...
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.