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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Dr. Paul M.B. Vitányi is a CWI Fellow at the Netherlands National Research Institute for Mathematics and Computer Science (CWI), and a Professor of Computer Science at the University of Amsterdam. Dr. Ming Li is Canada Research Chair in Bioinformatics and University Professor at the University of Waterloo, ON, Canada.
---
Textbook & Academic Authors Association 2020 McGuffey Longevity Award Winner!
The judges said:
"An Introduction to Kolmogorov complexity and Its Applications has been an outstanding textbook and comprehensive reference for on information complexity for over twenty years. This new edition continues that tradition by laying a terrific foundation in the early chapters for the more advanced theories and concepts that follow. Each new theorem and corollary flows naturally and logically from what came before."
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Scissortail, Oklahoma City, OK, Etats-Unis
Etat : good. This is a pre-loved book that shows moderate signs of wear from previous reading. You may notice creases, edge wear, or a cracked spine, but it remains in solid, readable condition.Please note:-May include library or rental stickers, stamps, or markings.-Supplemental materials e.g., CDs, access codes, inserts are not guaranteed.-Box sets may not come with the original outer box. If it does, the box will not be in perfect condition. -Sourced from donation centers; authenticity not verified with publisher. Your satisfaction is our top priority! If you have any questions or concerns about your order, please don't hesitate to reach out. Thank you for shopping with us and supporting small businessâ"happy reading! N° de réf. du vendeur STM.7W5
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. N° de réf. du vendeur edbd28310fd09a3857fc176b50a2516f
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 34948542-n
Quantité disponible : Plus de 20 disponibles
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783030112974
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 4th edition. 834 pages. 10.25x7.25x2.00 inches. In Stock. N° de réf. du vendeur __3030112977
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 34948542
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. 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 Gacs-Kucera theorem, the Day-Gacs theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovasz 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9783030112974
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore, Milano, MI, Italie
Etat : new. N° de réf. du vendeur edbd28310fd09a3857fc176b50a2516f
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 860 pp. Englisch. N° de réf. du vendeur 9783030112974
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Develops Kolmogorov theory in detail, and outlines a wide range of illustrative applicationsExamines major results from prominent researchers in the fieldDetails the practical application of KC in the similarity metric and informatio. N° de réf. du vendeur 259166529
Quantité disponible : Plus de 20 disponibles