Information, Randomness & Incompleteness: Papers on Algorithmic Information Theory Contributor(s): Chaitin, Gregory J. (Author) |
|||
ISBN: 9971504804 ISBN-13: 9789971504809 Publisher: World Scientific Publishing Company
Binding Type: Paperback Published: December 1987 Click for more in this series: World Scientific Computer Science |
Additional Information |
BISAC Categories: - Mathematics | Logic - Computers | Computer Science |
Dewey: 511.3 |
LCCN: 87027418 |
Series: World Scientific Computer Science |
Physical Information: 0.6" H x 6" W x 8.4" L (0.9 lbs) 284 pages |
Descriptions, Reviews, Etc. |
Publisher Description: 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. |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |