株式会社極東書店トップ ＞ 商品一覧 ＞ Kolmogorov Complexity and Algorithmic Randomness.
商品詳細
Kolmogorov Complexity and Algorithmic Randomness.
・ISBN 978-1-4704-7064-7 paper US$ 129.00
￥30,224.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Shen, A. / Uspensky, V. A. / Vereshchagin, N., |
|---|---|
| シリーズ | Mathematical Surveys and Monographs |
| 出版社 | (American Mathematical Society, US) |
| 出版年月 | 2017 |
| ページ数 | 511 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-25881＞ |
解説
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.
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.