Kolmogorov complexity and algorithmic randomness

By: Shen, AContributor(s): Uspenskii, V. A | Vereshchagin, Nikolai KonstantinovichMaterial type: Computer fileComputer fileSeries: Mathematical Surveys and Monographs ; v. 220Publication details: Providence, R.I. : American Mathematical Society, 2017Description: 1 online resource (xviii, 511 pages : illustrations)ISBN: 9781470440831 (online)Subject(s): Computational complexity | Computer science -- Theory of computing -- Algorithmic information theory (Kolmogorov complexity, etc.) | Information theory | Kolmogorov complexity | 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 sectionOnline resources: Click here to access online
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number URL Status Date due Barcode Item holds
electronic book electronic book ICTS
Link to resource Accessible Online EBK23728
Total holds: 0

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

There are no comments on this title.

to post a comment.