MARC details
000 -LEADER |
fixed length control field |
02473cam a22002898i 4500 |
001 - CONTROL NUMBER |
control field |
138307 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
ISI Library, Kolkata |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20180502170241.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
161028s2017 riu b 001 0 eng |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781470431822 (alk. paper) |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
ISI Library |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
510MS |
Edition number |
23 |
Item number |
Am512 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Shen, A., |
Relator term |
author |
245 10 - TITLE STATEMENT |
Title |
Kolmogorov complexity and algorithmic randomness / |
Statement of responsibility, etc |
A. Shen, V. A. Uspensky and N. Vereshchagin. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
Providence : |
Name of publisher, distributor, etc |
American Mathematical Society, |
Date of publication, distribution, etc |
©2017. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xviii, 511 pages : |
Other physical details |
illustrations ; |
Dimensions |
27 cm. |
490 0# - SERIES STATEMENT |
Series statement |
Mathematical surveys and monographs ; |
Volume number/sequential designation |
v 220. |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliographical references and index. |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
Preface --<br/> Basic notions and notation --<br/> Introduction : What is this book about? --<br/>1. Plain Kolmogorov complexity -<br/>2. Complexity of pairs and conditional complexity --<br/>3. Martin-Löf randomness --<br/>4. A priori probability and prefix complexity --<br/>5. Monotone complexity --<br/>6. General scheme for complexities --<br/>7. Shannon entropy and Kolmogorov complexity --<br/>8. Some applications --<br/>9. Frequency and game approaches to randomness --<br/>10. Inequalities for entropy, complexity, and size --<br/>11. Common information --<br/>12. Multisource algorithmic information theory --<br/>13. Information and logic --<br/>14. Algorithmic statistics --<br/>Appendix 1. Complexity and foundations of probability --<br/>Appendix 2. Four algorithmic faces of randomness. |
520 ## - SUMMARY, ETC. |
Summary, etc |
This edition reprints in one volume the second edition of this title, which was published in three volumes by The MIT Press in 1969. The original edition was published in 1964, translated from the Russian. Eighteen Russian mathematicians survey the scope of math, from elementary to the advanced levels, writing to educate a lay audience those with "secondary school mathematics" who are motivated to know more. Discussion includes both the origins and the development of analytic geometry, algebra, ordinary differential equations, partial differential equations, curve and surface theories, prime numbers, probability, functions of a complex variable, linear algebra, non-Euclidean geometry, topology, functional analysis, and groups and other algebraic systems. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Kolmogorov complexity. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Computational complexity. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Information theory. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Uspensky, V. A., |
Relator term |
author |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Vereshchagin, N., |
Relator term |
author |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Koha item type |
Books |