An edition of Kolmogorov Complexity and Algorithmic Randomness
(2017)
Kolmogorov Complexity and Algorithmic Randomness
by A. Shen, V. A. Uspensky, and N. Vereshchagin
- 0 Ratings
- 0 Want to read
- 0 Currently reading
- 0 Have read
Share
×Close
Check nearby libraries
Buy this book
This edition 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 statisticsShowing 1 featured edition. View all 1 editions?
| Edition | Availability |
|---|---|
1
Kolmogorov Complexity and Algorithmic Randomness
2017, American Mathematical Society
in English
1470431823 9781470431822
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created July 18, 2022
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| December 17, 2022 | Edited by MARC Bot | import existing book |
| July 18, 2022 | Created by ImportBot | Imported from Better World Books record |