"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.

Inhalt

1. Mathematical Background.- 2. Noiseless Coding.- 3. Program Size.- 4. Recursively Enumerable Instantaneous Codes.- 5. Random Strings.- 6. Random Sequences.- 7. Applications.- 8. Open Problems.- Notation Index.- Author Index.