Information and Randomness
Subtitle: An Algorithmic Perspective
By: by Cristian Calude
Series: Monographs in Theoretical Computer Science An EATCS Series; Monographs in Theoretical Computer Science An EATCS Series
Publisher: Springer Berlin Heidelberg
Published: 1994
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] :
Number of pages: 243
ISBN-13: 9783662030516; 9783662030493
Subjects: Statistics; Coding theory; Computer science; Mathematics; Distribution (Probability theory); Computer software
Description: "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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.