Information, Randomness and Incompleteness: Papers On Algorithmic Information Theory

Gregory J Chaitin

ISBN 10: 9971504804 / ISBN 13: 9789971504809

Published by EPB Publishers Pte Ltd, SG, 1987

About this Item

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.

Seller Inventory # LU-9789971504809

Bibliographic Details

• Title: Information, Randomness and Incompleteness: Papers On Algorithmic Information Theory
• Publisher: EPB Publishers Pte Ltd, SG
• Publication Date: 1987
• Language: English
• ISBN 10: 9971504804
• ISBN 13: 9789971504809
• Binding: Paperback
• Condition: New

About this title

Synopsis

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.

From the Back Cover

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.