Opening book details…
Can I read Information and Randomness: An Algorithmic Perspective (E a T C S Monographs on Theoretical Computer Science) on EtoBox?
Information and Randomness: An Algorithmic Perspective (E a T C S Monographs on Theoretical Computer Science) by Cristian Calude; forewords by Gregory J. Chaitin and Arto Salomaa is a book available to read on EtoBox.
What is Information and Randomness: An Algorithmic Perspective (E a T C S Monographs on Theoretical Computer Science) about?
'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.
- Author
- Cristian Calude; forewords by Gregory J. Chaitin and Arto Salomaa
- Publisher
- Springer Spektrum. in Springer-Verlag GmbH
- Published
- 2013
- Language
- EN
- ISBN
- 9783540574569
- Subjects
- Computer Science, Mathematics, Programming
- Updated
- 2026-03-24
Other editions & translations
- Information and randomness: an algorithmic perspective Second Edition, Revised and Extended (2002)
- Information and Randomness: An Algorithmic Perspective (E a T C S Monographs on Theoretical Computer Science) (1994)
- Information and randomness: An algorithmic perspective (Monographs on theoretical computer science) (1994)
More by Cristian Calude; forewords by Gregory J. Chaitin and Arto Salomaa
Browse all works by Cristian Calude; forewords by Gregory J. Chaitin and Arto Salomaa
Similar books
- Information, Randomness & Incompleteness: Papers on Algorithmic Information Theory (World Scientific Computer Science) — Gregory J. Chaitin (1987)
- Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs) — A. Shen, V. A. Uspensky, N. Vereshchagin (2017)
- Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1) — Chaitin, Gregory. J. (2004)
- Exploring Randomness (Discrete Mathematics and Theoretical Computer Science) — Gregory J. Chaitin (2001)
- Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) — Richard Lassaigne; Michel de Rougemont (2012)
- Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) — Ferdinando Cicalese (2013)