An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

★★★★★ 4.3 26 reviews

US$30.41
Price when purchased online
Free shipping Free 30-day returns

Sold and shipped by logmaster.hu
We aim to show you accurate product information. Manufacturers, suppliers and others provide what you see here.
US$30.41
Price when purchased online
Free shipping Free 30-day returns

How do you want your item?
You get 30 days free! Choose a plan at checkout.
Shipping
Arrives Jul 16
Free
Pickup
Check nearby
Delivery
Not available

Sold and shipped by logmaster.hu
Free 30-day returns Details

Product details

Management number 233372216 Release Date 2026/06/27 List Price US$30.41 Model Number 233372216
Category

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.Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface.As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science. Read more

ASIN B07T2489WN
XRay Not Enabled
Format Print Replica
ISBN13 978-3030112981
Edition 4th
Language English
File size 18.0 MB
Page Flip Not Enabled
Publisher Springer
Word Wise Not Enabled
Print length 857 pages
Accessibility Learn more
Part of series Texts in Computer Science
Publication date June 11, 2019
Enhanced typesetting Not Enabled

Correction of product information

If you notice any omissions or errors in the product information on this page, please use the correction request form below.

Correction Request Form

Customer ratings & reviews

4.3 out of 5
★★★★★
26 ratings | 11 reviews
How item rating is calculated
View all reviews
5 stars
80% (21)
4 stars
6% (2)
3 stars
3% (1)
2 stars
1% (0)
1 star
10% (3)
Sort by

There are currently no written reviews for this product.