World Scientific Series in Computer Science - Vol. 8
INFORMATION, RANDOMNESS AND INCOMPLETENESS
Papers on Algorithmic Information Theory (2nd Edition)
by Gregory J Chaitin (IBM, NY)
This book contains in easily accessible form all the main ideas of the creator and principal architect of algorithmic information theory. This expanded second edition has added thirteen abstracts, a 1988 Scientific American Article, a transcript of a EUROPALIA 89 lecture, an essay on biology, and an extensive bibliography. Its new larger format makes it easier to read. Chaitin's ideas are a fundamental extension of those of Gödel and Turning and have exploded some basic assumptions of mathematics and thrown new light on the scientific method, epistemology, probability theory, and of course computer science and information theory.
Contents:
- Introductory/Tutorial/Survey Papers
- Applications to
Metamathematics
- Applications to Biology
- Technical Papers on Self-Delimiting Programs
- Technical Papers on Blank-Endmarker Programs
- Technical Papers on Turning Machines & LISP
- Abstracts
- Bibliography
- Epilogue
Readership: Computer scientists, mathematicians, physicists, philosophers and biologists.
"One will find [Information, Randomness and Incompleteness] all kinds of articles which are popularizations or epistemological reflections and presentations which permit one to rapidly obtain a precise idea of the subject and of some of its applications (in particular in the biological domain). Very complete, it is recommended to anyone who is interested in algorithmic information theory." (translated)
| Jean-Paul Delahaye in La Recherche |
"No one, but no one, is exploring to greater depths the amazing insights and theorems that flow from Gödel's work on undecidability than Gregory Chaitin. His exciting discoveries and speculations invade such areas as logic, induction, simplicity, the philosophy of mathematics and science, randomness, proof theory, chaos, information theory, computer complexity, diophantine analysis and even the origin and evolution of life."
"Gregory Chaitin ... has proved the ultimate in undecidability theorems ..., that the logical structure of arithmetic can be random ... The assumption that the formal structure of arithmetic is precise and regular turns out to have been a time-bomb and Chaitin has just pushed the detonator."
| 324pp |
Pub. date: Jan 1990 |
|
