© 1994

Information and Randomness

An Algorithmic Perspective


Table of contents

  1. Front Matter
    Pages I-XVI
  2. Cristian Calude
    Pages 1-14
  3. Cristian Calude
    Pages 15-24
  4. Cristian Calude
    Pages 25-39
  5. Cristian Calude
    Pages 41-70
  6. Cristian Calude
    Pages 71-106
  7. Cristian Calude
    Pages 107-182
  8. Cristian Calude
    Pages 183-216
  9. Cristian Calude
    Pages 217-219
  10. Back Matter
    Pages 221-243

About this book


"Algorithmic information theory (AIT) is the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously", says G.J. Chaitin, one of the fathers of this theory of complexity and randomness, which is also known as Kolmogorov complexity.
It is relevant for logic (new light is shed on Gödel's incompleteness results), physics (chaotic motion), biology (how likely is life to appear and evolve?), and metaphysics (how ordered is the universe?).
This book, benefiting from the author's research and teaching experience in Algorithmic Information Theory (AIT), should help to make the detailed mathematical techniques of AIT accessible to a much wider audience.


Chaitin Complexity Halting Probability Kolmogorov complexity Random String/Sequence Shannon algorithmic information theory algorithms complexity computability computability theory information information theory linear optimization logic randomness

Authors and affiliations

  1. 1.Department of Computer ScienceAuckland UniversityAucklandNew Zealand
  2. 2.Faculty of MathematicsBucharest UniversityBucharestRomania

Bibliographic information

Industry Sectors
IT & Software