Buy 2 get 1 free. Everything is calculated at checkout.
An Introduction to Kolmogorov Complexity and Its Applications by Ming Li
Digital download. Taxes calculated at checkout.
Buy 2, get 1 free, applied automatically at checkout.
- Instant delivery by email
- Read on any device
- Secure checkout
This must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features.
This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kučera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution.
- Title
- An Introduction to Kolmogorov Complexity and Its Applications by Ming Li
- Format
- Language
- English
- Delivery
- Download link by email
How you receive it
Right after payment, a download link is emailed to the address you entered at checkout.
Didn't get the email?
Check your spam or promotions folder. If it's not there, contact us with your order number.
30-day money-back guarantee
If the file doesn't work, we'll replace it or refund you.
Can't find a book? Send us the cover in live chat and we'll look for it. We usually reply within 10 minutes.