World Scientific Series in Computer Science - Vol. 8
INFORMATION, RANDOMNESS & INCOMPLETENESS
Papers on Algorithmic Information Theory
by Gregory J. Chaitin (IBM)
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.
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 Turing Machines
Readership: Computer scientists, mathematicians, physicists and philosophers.
"Many of Chaitin's results are discussed in a delightful collection of his published articles."
JosephFord
American Scientist, 1989 |
"Chaitin advances the cause of truths whose time have come; he is preparing a roadmap to ease our voyage into a truly uncertain future. Those who embark on this great adventure will most assuredly find sustenance in the books reviewed here."
JosephFord
Foundations of Physics, 1989 |
| 284pp |
Pub. date: Dec 1987 |
|
