Kolmogorov complexity and algorithmic randomness

Bibliographic Information

Kolmogorov complexity and algorithmic randomness

A. Shen, V.A. Uspensky, N. Vereshchagin

(Mathematical surveys and monographs, v. 220)

American Mathematical Society, c2017

Other Title

Колмогоровская сложность и алгоритмическая случайность

Available at  / 31 libraries

Search this Book/Journal

Note

Includes bibliographical references (p. 491-500) and indexes

Related Books: 1-1 of 1

Details

Page Top