Kolmogorov complexity and algorithmic randomness /

Bibliographic Details
Main Authors:	Shen, A. (Alexander), 1958- (Author), Uspenskiĭ, V. A. (Vladimir Andreevich) (Author), Vereshchagin, Nikolai Konstantinovich, 1958- (Author)
Format:	Book
Language:	English
Published:	Providence, Rhode Island : American Mathematical Society, [2017]
Series:	Mathematical surveys and monographs ; no. 220.
Subjects:	Kolmogorov complexity. Computational complexity. Information theory. Computer science > Theory of computing > Algorithmic information theory (Kolmogorov complexity, etc.) Mathematical logic and foundations > Computability and recursion theory > Algorithmic randomness and dimension. Probability theory and stochastic processes > Foundations of probability theory > None of the above, but in this section. Mathematics education > Combinatorics, graph theory, probability theory, statistics > Foundations and methodology of statistics.

Description
Physical Description:	xviii, 511 pages : illustrations ; 27 cm.
Bibliography:	Includes bibliographical references (pages 491-500) and indexes.
ISBN:	9781470431822 1470431823