Softcover ISBN: | 978-1-4704-7064-7 |
Product Code: | SURV/220.S |
List Price: | $129.00 |
MAA Member Price: | $116.10 |
AMS Member Price: | $103.20 |
eBook ISBN: | 978-1-4704-4083-1 |
Product Code: | SURV/220.E |
List Price: | $125.00 |
MAA Member Price: | $112.50 |
AMS Member Price: | $100.00 |
Softcover ISBN: | 978-1-4704-7064-7 |
eBook: ISBN: | 978-1-4704-4083-1 |
Product Code: | SURV/220.S.B |
List Price: | $254.00 $191.50 |
MAA Member Price: | $228.60 $172.35 |
AMS Member Price: | $203.20 $153.20 |
Softcover ISBN: | 978-1-4704-7064-7 |
Product Code: | SURV/220.S |
List Price: | $129.00 |
MAA Member Price: | $116.10 |
AMS Member Price: | $103.20 |
eBook ISBN: | 978-1-4704-4083-1 |
Product Code: | SURV/220.E |
List Price: | $125.00 |
MAA Member Price: | $112.50 |
AMS Member Price: | $100.00 |
Softcover ISBN: | 978-1-4704-7064-7 |
eBook ISBN: | 978-1-4704-4083-1 |
Product Code: | SURV/220.S.B |
List Price: | $254.00 $191.50 |
MAA Member Price: | $228.60 $172.35 |
AMS Member Price: | $203.20 $153.20 |
-
Book DetailsMathematical Surveys and MonographsVolume: 220; 2017; 511 ppMSC: Primary 68; 03; 60; 97
Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.
The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the “Kolmogorov seminar” in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues.
This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.
ReadershipGraduate students and researchers interested in topics related to an algorithmic approach to complexity and randomness.
-
Table of Contents
-
Chapters
-
What is this book about?
-
Plain Kolmogorov complexity
-
Complexity of pairs and conditional complexity
-
Martin-Löf randomness
-
A priori probability and prefix complexity
-
Monotone complexity
-
General scheme for complexities
-
Shannon entropy and Kolmogorov complexity
-
Some applications
-
Frequency and game approaches to randomness
-
Inequalities for entropy, complexity, and size
-
Common information
-
Multisource algorithmic information theory
-
Information and logic
-
Algorithmic statistics
-
Complexity and foundations of probability
-
Four algorithmic faces of randomness
-
-
Additional Material
-
Reviews
-
This book is an excellent reference for the working mathematician and would also serve well as a text for a graduate course. The exercises fit well into the text and are at an appropriate level.
Johanna N. Y. Franklin, Mathematical Reviews
-
-
RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Reviews
- Requests
Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.
The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the “Kolmogorov seminar” in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues.
This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.
Graduate students and researchers interested in topics related to an algorithmic approach to complexity and randomness.
-
Chapters
-
What is this book about?
-
Plain Kolmogorov complexity
-
Complexity of pairs and conditional complexity
-
Martin-Löf randomness
-
A priori probability and prefix complexity
-
Monotone complexity
-
General scheme for complexities
-
Shannon entropy and Kolmogorov complexity
-
Some applications
-
Frequency and game approaches to randomness
-
Inequalities for entropy, complexity, and size
-
Common information
-
Multisource algorithmic information theory
-
Information and logic
-
Algorithmic statistics
-
Complexity and foundations of probability
-
Four algorithmic faces of randomness
-
This book is an excellent reference for the working mathematician and would also serve well as a text for a graduate course. The exercises fit well into the text and are at an appropriate level.
Johanna N. Y. Franklin, Mathematical Reviews