An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
Description
Condition - Very Good
The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.
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.
Shipping & Delivery
Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.
Returns & Exchanges
We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.