Order Total (1 Item Items):
Shipping Destination:
Kolmogorov Complexity Algorithmic Randomness by Shen Uspensky (6 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (6)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (6)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (6)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (3)
- Not Print on Demand (6)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
Kolmogorov Complexity and Algorithmic Randomness
Published by Amer Mathematical Society, 2022
ISBN 10: 1470470640 ISBN 13: 9781470470647
Language: English
Paperback. Condition: Brand New. 511 pages. 10.00x7.13x1.26 inches. In Stock.
-
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220)
Published by American Mathematical Society, 2022
ISBN 10: 1470470640 ISBN 13: 9781470470647
Language: English
Condition: New.
-
Kolmogorov Complexity and Algorithmic Randomness
Published by American Mathematical Society, US, 2017
ISBN 10: 1470470640 ISBN 13: 9781470470647
Language: English
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.
-
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220)
Published by American Mathematical Society, 2022
ISBN 10: 1470470640 ISBN 13: 9781470470647
Language: English
Condition: New. 220th edition NO-PA16APR2015-KAP.
-
Kolmogorov Complexity and Algorithmic Randomness
Published by American Mathematical Society, 2017
ISBN 10: 1470470640 ISBN 13: 9781470470647
Language: English
Condition: New.
-
Kolmogorov Complexity and Algorithmic Randomness
Published by American Mathematical Society, US, 2017
ISBN 10: 1470470640 ISBN 13: 9781470470647
Language: English
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.
