My Account Log in

1 option

Kolmogorov complexity and algorithmic randomness / A. Shen, V.A. Uspensky, N. Vereshchagin.

Math/Physics/Astronomy Library QA267.7 .S52413 2017
Loading location information...

Available This item is available for access.

Log in to request item
Format:
Book
Author/Creator:
Shen, A. (Alexander), 1958- author.
Uspenskiĭ, V. A. (Vladimir Andreevich), author.
Vereshchagin, N. K., 1928- author.
Series:
Mathematical surveys and monographs ; v. 220.
Mathematical surveys and monographs ; volume 220
Standardized Title:
Kolmogorovskai͡a slozhnostʹ i algoritmicheskai͡a sluchaĭnostʹ. English
Колмогоровская сложность и алгоритмическая случайность. English http://id.loc.gov/authorities/names/n2016059086
Language:
English
Russian
Subjects (All):
Kolmogorov complexity.
Computational complexity.
Information theory.
Physical Description:
xviii, 511 pages : illustrations ; 27 cm.
Place of Publication:
Providence, Rhode Island : American Mathematical Society, [2017]
Notes:
Includes bibliographical references (pages 491-500) and index.
ISBN:
9781470431822
1470431823
OCLC:
961457666

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account