Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220) - Softcover
Synopsis
Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory. The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the “Kolmogorov seminar” in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues. This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.
"synopsis" may belong to another edition of this title.
About the Author
A. Shen, LIRMM CRNS, Université de Montpellier, France, V. A. Uspensky, Lomonosov Moscow State University, Russia, and N. Vereshchagin, Lomonosov Moscow State University, Russia
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Kolmogorov Complexity and Algorithmic Randomness (Mathematic...
Stock Image
Kolmogorov Complexity and Algorithmic Randomness
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FW-9781470470647
Buy New
US$ 156.82
Shipping:
US$ 6.65
From United Kingdom to U.S.A.
Quantity: 10 available
Stock Image
Kolmogorov Complexity and Algorithmic Randomness
Published by
Amer Mathematical Society, 2022
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 511 pages. 10.00x7.13x1.26 inches. In Stock. Seller Inventory # __1470470640
Buy New
US$ 160.86
Shipping:
US$ 16.55
From United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Kolmogorov Complexity and Algorithmic Randomness (Paperback)
Published by
American Mathematical Society, Providence, 2017
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the "Kolmogorov seminar" in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues.This book contains numerous exercises (embedded in the text) that will help readers to grasp the material. Offers a textbook-style exposition of the basic notions of complexity and randomness; then covers some recent work done by participants of the Kolmogorov seminar in Moscow. The book contains numerous exercises (embedded in the text) that will help readers to grasp the material. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781470470647
Stock Image
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220)
Published by
American Mathematical Society, 2022
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 401287560
Buy New
US$ 182.17
Shipping:
US$ 8.61
From United Kingdom to U.S.A.
Quantity: 3 available
Seller Image
Kolmogorov Complexity and Algorithmic Randomness
Published by
American Mathematical Society, US, 2017
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the "Kolmogorov seminar" in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues.This book contains numerous exercises (embedded in the text) that will help readers to grasp the material. Seller Inventory # LU-9781470470647
Stock Image
Kolmogorov Complexity and Algorithmic Randomness
Published by
American Mathematical Society, 2022
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. New copy - Usually dispatched within 4 working days. Seller Inventory # B9781470470647
Buy New
US$ 176.42
Shipping:
US$ 21.20
From United Kingdom to U.S.A.
Quantity: 10 available
Stock Image
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220)
Published by
American Mathematical Society, 2022
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. 220th edition NO-PA16APR2015-KAP. Seller Inventory # 26396138071
Seller Image
Kolmogorov Complexity and Algorithmic Randomness
Published by
American Mathematical Society, 2017
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 880961575
Buy New
US$ 152.47
Shipping:
US$ 56.83
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Kolmogorov Complexity and Algorithmic Randomness
Published by
American Mathematical Society Jan 2017, 2017
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Neuware. Seller Inventory # 9781470470647
Seller Image
Kolmogorov Complexity and Algorithmic Randomness
Published by
American Mathematical Society, US, 2017
ISBN 10: 1470470640
ISBN 13: 9781470470647
New
Paperback
Seller: Rarewaves.com UK, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the "Kolmogorov seminar" in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues.This book contains numerous exercises (embedded in the text) that will help readers to grasp the material. Seller Inventory # LU-9781470470647
Buy New
US$ 188.52
Shipping:
US$ 86.06
From United Kingdom to U.S.A.
Quantity: 5 available