Kolmogorov Complexity and Algorithmic Randomness - Mathematical Surveys and Monographs (Hardback)
  • Kolmogorov Complexity and Algorithmic Randomness - Mathematical Surveys and Monographs (Hardback)
zoom

Kolmogorov Complexity and Algorithmic Randomness - Mathematical Surveys and Monographs (Hardback)

(author), (author), (author)
£118.00
Hardback 499 Pages / Published: 30/11/2017
  • We can order this

Usually dispatched within 2 weeks

  • This item has been added to your basket
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.

Publisher: American Mathematical Society
ISBN: 9781470431822
Number of pages: 499
Dimensions: 254 x 178 mm

You may also be interested in...

Alan Turing's Systems of Logic
Added to basket
Godel's Proof
Added to basket
£10.99
Paperback
How to Prove It
Added to basket
Equation That Couldn't be Solved
Added to basket
The Foundations of Mathematics
Added to basket
Logic
Added to basket
£10.99
Paperback
John Napier
Added to basket
Great at My Job but Crap at Numbers
Added to basket
Numbers and Proofs
Added to basket
£46.99
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.