An edition of Kolmogorov Complexity and Algorithmic Randomness
(2017)
Kolmogorov Complexity and Algorithmic Randomness
by A. Shen, V. A. Uspensky, and N. Vereshchagin
Share
×Close
This work doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Subjects
Computational complexity, Information theory, Computer science, Stochastic processes, Kolmogorov complexity, 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| Edition | Availability |
|---|---|
1
Kolmogorov Complexity and Algorithmic Randomness
2017, American Mathematical Society
in English
1470431823 9781470431822
|
aaaa
|
Book Details
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
| December 17, 2022 | Edited by MARC Bot | import existing book |
| July 18, 2022 | Created by ImportBot | import new book |