An Introduction to Kolmogorov Complexity and Its Applications
Ming Li
Sold by PBShop.store UK, Fairford, GLOS, United Kingdom
AbeBooks Seller since June 11, 1999
New - Hardcover
Condition: New
Quantity: 15 available
Add to basketSold by PBShop.store UK, Fairford, GLOS, United Kingdom
AbeBooks Seller since June 11, 1999
Condition: New
Quantity: 15 available
Add to basketNew Book. Shipped from UK. Established seller since 2000.
Seller Inventory # S0-9783030112974
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.
"About this title" may belong to another edition of this title.
Returns Policy
We ask all customers to contact us for authorisation should they wish to return their order. Orders returned without authorisation may not be credited.
If you wish to return, please contact us within 14 days of receiving your order to obtain authorisation.
Returns requested beyond this time will not be authorised.
Our team will provide full instructions on how to return your order and once received our returns department will process your refund.
Please note the cost to return any...
Orders are shipped from our UK warehouse. Delivery thereafter is between 4 and 14 business days. Please contact us if you have any queries about our services or products.