Picture 1 of 1
Gallery
Picture 1 of 1
Have one to sell?
An Introduction to Kolmogorov Complexity and Its Applications by Ming Li: New
US $112.51
ApproximatelyS$ 144.17
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free Standard Shipping.
Located in: Sparks, Nevada, United States
Delivery:
Estimated between Wed, 27 Aug and Wed, 3 Sep to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:362744439342
Item specifics
- Condition
- Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
- Book Title
- An Introduction to Kolmogorov Complexity and Its Applications
- Publication Date
- 2019-06-26
- Edition Number
- 4
- ISBN
- 9783030112974
About this product
Product Identifiers
Publisher
Springer International Publishing A&G
ISBN-10
3030112977
ISBN-13
9783030112974
eBay Product ID (ePID)
26038415919
Product Key Features
Number of Pages
Xxiii, 834 Pages
Publication Name
Introduction to Kolmogorov Complexity and Its Applications
Language
English
Subject
Information Theory, Computer Science, Data Processing, Applied
Publication Year
2019
Type
Textbook
Subject Area
Mathematics, Computers
Series
Texts in Computer Science Ser.
Format
Hardcover
Dimensions
Item Weight
84.5 Oz
Item Length
10 in
Item Width
7 in
Additional Product Features
Edition Number
4
TitleLeading
An
Dewey Edition
22
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
510
Table Of Content
Preliminaries.- Algorithmic Complexity.- Algorithmic Prefix Complexity.- Algorithmic Probability.- Inductive Reasoning.- The Incompressibility Method.- Resource-Bounded Complexity.- Physics, Information, and Computation.
Synopsis
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-Kucera 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., "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., 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., 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.
LC Classification Number
T57-57.97
Item description from the seller
Seller feedback (516,168)
- 4***n (27)- Feedback left by buyer.Past monthVerified purchaseItem as described! Really happy with the condition of the disc and case
- l***l (194)- Feedback left by buyer.Past monthVerified purchaseA++++
- 4***a (56)- Feedback left by buyer.Past monthVerified purchaseGreat price and quick shipping. The book was carefully packed!
Seller feedback (516,168)
- 4***n (27)- Feedback left by buyer.Past monthVerified purchaseItem as described! Really happy with the condition of the disc and case
- l***l (194)- Feedback left by buyer.Past monthVerified purchaseA++++
- 4***a (56)- Feedback left by buyer.Past monthVerified purchaseGreat price and quick shipping. The book was carefully packed!