Skip to main content Skip to search Skip to search

Computers Computer Science

An Introduction to Kolmogorov Complexity and Its Applications

by (author) Ming Li & Paul M.B. Vitányi

Publisher
Springer/Sci-Tech/Trade
Initial publish date
Nov 2008
Category
Computer Science
  • Hardback

    ISBN
    9780387339986
    Publish Date
    Nov 2008
    List Price
    $156.5

Classroom Resources

Where to buy it

Out of print

This edition is not currently available in bookstores. Check your local library or search for used copies at Abebooks.

Description

"The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field." Journal of Symbolic Logic

Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing. It will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. The book is self-contained in that it contains the basic requirements from mathematics and computer science. Included are also numerous problem sets, comments, source references, and hints to solutions of problems. New topics in this edition include Omega numbers, Kolmogorov-Loveland randomness, universal learning, communication complexity, Kolmogorov's random graphs, time-limited universal distribution, Shannon information and others.

About the authors