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

Format:

Book

Author/Creator:

Shen, A. (Alexander), 1958-

Contributor:

Uspenskiĭ, V. A. (Vladimir Andreevich)

Vereshchagin, Nikolai Konstantinovich, 1958-

Series:

Mathematical surveys and monographs ; v. 220.

Mathematical Surveys and Monographs, 2331-7159 ; v. 220

Standardized Title:

Kolmogorovskaya slozhnost i algoritmieskaya sluchanost. English

Language:

English

Russian

Subjects (All):

Kolmogorov complexity.

Computational complexity.

Information theory.

Physical Description:

1 online resource (xviii, 511 pages) : illustrations.

Other Title:

Mathematical Surveys and Monographs.

Place of Publication:

Providence, Rhode Island : American Mathematical Society, [2017]

System Details:

Mode of access : World Wide Web

text file

Contents:

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

Notes:

Includes bibliographical references (pages 491-500) and index.

Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2017

Description based on print version record.

Other Format:

Print version: Shen, A. 1958- Kolmogorov complexity and algorithmic randomness /

ISBN:

9781470440831

Access Restriction:

Restricted for use by site license.