| 000 | 02473cam a22002898i 4500 | ||
|---|---|---|---|
| 001 | 138307 | ||
| 003 | ISI Library, Kolkata | ||
| 005 | 20180502170241.0 | ||
| 008 | 161028s2017 riu b 001 0 eng | ||
| 020 | _a9781470431822 (alk. paper) | ||
| 040 | _aISI Library | ||
| 082 | 0 | 4 |
_a510MS _223 _bAm512 |
| 100 | 1 |
_aShen, A., _eauthor |
|
| 245 | 1 | 0 |
_aKolmogorov complexity and algorithmic randomness / _cA. Shen, V. A. Uspensky and N. Vereshchagin. |
| 260 |
_aProvidence : _bAmerican Mathematical Society, _c©2017. |
||
| 300 |
_axviii, 511 pages : _billustrations ; _c27 cm. |
||
| 490 | 0 |
_aMathematical surveys and monographs ; _vv 220. |
|
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 0 | _aPreface -- Basic notions and notation -- Introduction : What is this book about? -- 1. Plain Kolmogorov complexity - 2. Complexity of pairs and conditional complexity -- 3. Martin-Löf randomness -- 4. A priori probability and prefix complexity -- 5. Monotone complexity -- 6. General scheme for complexities -- 7. Shannon entropy and Kolmogorov complexity -- 8. Some applications -- 9. Frequency and game approaches to randomness -- 10. Inequalities for entropy, complexity, and size -- 11. Common information -- 12. Multisource algorithmic information theory -- 13. Information and logic -- 14. Algorithmic statistics -- Appendix 1. Complexity and foundations of probability -- Appendix 2. Four algorithmic faces of randomness. | |
| 520 | _aThis 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 | _aKolmogorov complexity. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aInformation theory. | |
| 700 | 1 |
_aUspensky, V. A., _eauthor |
|
| 700 | 1 |
_aVereshchagin, N., _eauthor |
|
| 942 |
_2ddc _cBK |
||
| 999 |
_c424432 _d424432 |
||