Information and Randomness
An Algorithmic Perspective
Published on 25. November 1994
Book
Hardback
XVI, 243 pages
978-3-540-57456-9 (ISBN)
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.
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.
More details
Series
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
520 gr
ISBN-13
978-3-540-57456-9 (9783540574569)
DOI
10.1007/978-3-662-03049-3
Schweitzer Classification
Other editions
New editions
Book
09/2002
2nd Edition
Springer
€85.59
Shipment within 10-15 days
Persons
Content
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.