Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Kolmogorov complexity and algorithmic randomness / A. Shen, V. A. Uspensky and N. Vereshchagin.

By: Contributor(s): Material type: TextTextSeries: Mathematical surveys and monographs ; v 220.Publication details: Providence : American Mathematical Society, ©2017.Description: xviii, 511 pages : illustrations ; 27 cmISBN:
  • 9781470431822 (alk. paper)
Subject(s): DDC classification:
  • 510MS 23 Am512
Contents:
Preface -- Basic notions and notation -- Introduction : What is this book about? -- 1. Plain Kolmogorov complexity - 2. Complexity of pairs and conditional complexity -- 3. Martin-Löf randomness -- 4. A priori probability and prefix complexity -- 5. Monotone complexity -- 6. General scheme for complexities -- 7. Shannon entropy and Kolmogorov complexity -- 8. Some applications -- 9. Frequency and game approaches to randomness -- 10. Inequalities for entropy, complexity, and size -- 11. Common information -- 12. Multisource algorithmic information theory -- 13. Information and logic -- 14. Algorithmic statistics -- Appendix 1. Complexity and foundations of probability -- Appendix 2. Four algorithmic faces of randomness.
Summary: This edition reprints in one volume the second edition of this title, which was published in three volumes by The MIT Press in 1969. The original edition was published in 1964, translated from the Russian. Eighteen Russian mathematicians survey the scope of math, from elementary to the advanced levels, writing to educate a lay audience those with "secondary school mathematics" who are motivated to know more. Discussion includes both the origins and the development of analytic geometry, algebra, ordinary differential equations, partial differential equations, curve and surface theories, prime numbers, probability, functions of a complex variable, linear algebra, non-Euclidean geometry, topology, functional analysis, and groups and other algebraic systems.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references and index.

Preface --
Basic notions and notation --
Introduction : What is this book about? --
1. Plain Kolmogorov complexity -
2. Complexity of pairs and conditional complexity --
3. Martin-Löf randomness --
4. A priori probability and prefix complexity --
5. Monotone complexity --
6. General scheme for complexities --
7. Shannon entropy and Kolmogorov complexity --
8. Some applications --
9. Frequency and game approaches to randomness --
10. Inequalities for entropy, complexity, and size --
11. Common information --
12. Multisource algorithmic information theory --
13. Information and logic --
14. Algorithmic statistics --
Appendix 1. Complexity and foundations of probability --
Appendix 2. Four algorithmic faces of randomness.

This edition reprints in one volume the second edition of this title, which was published in three volumes by The MIT Press in 1969. The original edition was published in 1964, translated from the Russian. Eighteen Russian mathematicians survey the scope of math, from elementary to the advanced levels, writing to educate a lay audience those with "secondary school mathematics" who are motivated to know more. Discussion includes both the origins and the development of analytic geometry, algebra, ordinary differential equations, partial differential equations, curve and surface theories, prime numbers, probability, functions of a complex variable, linear algebra, non-Euclidean geometry, topology, functional analysis, and groups and other algebraic systems.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in