Information, randomness & incompleteness : papers on algorithmic information theory

Author(s)

• Chaitin, Gregory J.

Bibliographic Information

Information, randomness & incompleteness : papers on algorithmic information theory

Gregory J. Chaitin

（Series in computer science, v. 8）

World Scientific, c1987

• : pbk.

Note

Includes bibliographies

Description and Table of Contents

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 Goedel'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.

by "Nielsen BookData"

Details

• NCID: BA03412813
• ISBN:
  • 9971504790
  • 9971504804
• LCCN: 87027418
• Country Code: si
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Singapore ; Teaneck, NJ
• Pages/Volumes: x, 272 p.
• Size: 23 cm
• Classification:
  • LCC : QA267
  • DC19 : 511.3
• Subject Headings:
  • LCSH : Machine theory
  • LCSH : Computational complexity
  • LCSH : Stochastic processes
• Parent Bibliography ID:
  • BA00185577