Tools

LEADER 02898nam a2200565 i 4500

001 ssj0001905151;

003 WaSeSS;

005 20260712090213.0;

006 m d ;

007 cr n ;

008 161028t20172017riua sb 001 0 eng d;

010 a| 2016049293;

020 a| 9781470431822 (alk. paper);

020 a| 1470431823 (alk. paper);

035 a| (WaSeSS)ssj0001905151;

041 1 a| engh| rus;

042 a| pcc;

049 a| EREEa| NEHH;

050 00 a| QA267.7b| .S52413 2017;

082 00 a| 511.3/422| 23;

084 a| 68Q30a| 03D32a| 60A99a| 97K702| msc;

100 1 a| Shen, A.q| (Alexander),d| 1958-=| ^A520803;

240 10 a| Kolmogorovskaya slozhnost i algoritmieskaya sluchanost.l| English=| ^A520803;

245 10 a| Kolmogorov complexity and algorithmic randomnessh| [electronic resource] /c| A. Shen, V.A. Uspensky, N. Vereshchagin.;

260 a| Providence, Rhode Island :b| American Mathematical Society,c| [2017];

300 a| xviii, 511 pages :b| illustrations ;c| 27 cm.;

490 0 a| Mathematical surveys and monographs ;v| volume 220;

504 a| Includes bibliographical references (pages 491-500) and index.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Kolmogorov complexity.=| ^A322598;

650 0 a| Computational complexity.=| ^A74807;

650 0 a| Information theory.=| ^A16668;

650 7 a| Computer science -- Theory of computing -- Algorithmic information theory (Kolmogorov complexity, etc.).2| msc;

650 7 a| Mathematical logic and foundations -- Computability and recursion theory -- Algorithmic randomness and dimension.2| msc;

650 7 a| Probability theory and stochastic processes -- Foundations of probability theory -- None of the above, but in this section.2| msc;

650 7 a| Mathematics education -- Combinatorics, graph theory, probability theory, statistics -- Foundations and methodology of statistics.2| msc;

655 0 a| Electronic books.=| ^A491897;

700 1 a| Uspenskiĭ, V. A.q| (Vladimir Andreevich)=| ^A269602;

700 1 a| Vereshchagin, Nikolai Konstantinovich,d| 1958-=| ^A414472;

856 40 z| Full text available from eBooks on EBSCOhostu| https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1627545&scope=site&custid=s5822723&authtype=ip,shib;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 6766231;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6766231-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 7/18/2026x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6766231-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 7/18/2026x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 6766231-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 7/18/2026x| EBOOKz| JERESOURCE;

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

Author/creator	Shen, A., 1958-
Other author	Uspenskiĭ, V. A. (Vladimir Andreevich)
Other author	Vereshchagin, Nikolai Konstantinovich, 1958-
Format	Electronic
Publication Info	Providence, Rhode Island : American Mathematical Society, [2017]
Description	xviii, 511 pages : illustrations ; 27 cm.
Supplemental Content	Full text available from eBooks on EBSCOhost
Subjects	Kolmogorov complexity. Computational complexity. Information theory.

Uniform title	Kolmogorovskaya slozhnost i algoritmieskaya sluchanost. English
Series	Mathematical surveys and monographs ; volume 220
Bibliography note	Includes bibliographical references (pages 491-500) and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2016049293
ISBN	9781470431822 (alk. paper)
ISBN	1470431823 (alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

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

Click here for more information about this title

Availability