Normal view MARC view ISBD view

Kolmogorov complexity and algorithmic randomness/

Shen, A. 1958-

Kolmogorov complexity and algorithmic randomness/ A. Shen, V.A. Uspensky, N. Vereshchagin. - xviii, 511 pages: illustrations; 27 cm. - Mathematical surveys and monographs; volume 220 . - Mathematical surveys and monographs; no. 220. .

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

Translated into English from the original Russian.

ISBN: 9781470431822 1470431823

LCCN: 2016049293

Subjects--Topical Terms:
Kolmogorov complexity.
Computational complexity.
Information theory

Dewey Class. No.: 511.342 / S546k

Place hold
Print
Add to your cart (remove)
Suggest for purchase
Send to device
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)