The Resource An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi
An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi
Resource Information
The item An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
- Summary
- This ongoing bestseller, now in its third edition, is considered the standard reference on Kolmogorov complexity, a modern theory of information that is concerned with information in individual objects. New key features and topics in the 3rd edition: * New results on randomness * Kolmogorov's structure function, model selection, and MDL * Incompressibility method: counting unlabeled graphs, Shellsort, communication complexity * Derandomization * Kolmogorov complexity versus Shannon information, rate distortion, lossy compression, denoising * Theoretical results on information distance * The similarity metric with applications to genomics, phylogeny, clustering, classification, semantic meaning, question-answer systems *Quantum Kolmogorov complexity Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in all fields of science. It is self-contained: it contains the basic requirements from mathematics, probability theory, statistics, information theory, and computer science. Included are history, theory, new developments, a wide range of applications, numerous (new) problem sets, comments, source references, and hints to solutions of problems. This is the only comprehensive treatment of the central ideas of Kolmogorov complexity and their applications. Lì̀ and Vitányi have provided an ideal book for the exploration of a deep, beautiful and important part of computer science.'' -- Juris Hartmanis, Turing Award Winner 1993, Cornell University, Ithaca, NY. Th̀̀e book is likely to remain the standard treatment of Kolmogorov complexity for a long time.'' -- Jorma J. Rissanen, IBM Research, California. Th̀̀e book of Li and Vitányi is unexcelled.'' -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts "The book is outstanding ... the authors did their job unbelievably well ... necessary reading for all kinds of readers from undergraduate students to top authorities in the field."--Vladimir A. Uspensky and Alexander K. Shen, Journal of Symbolic Logic [Review] Cà̀reful and clear introduction to a subtle and deep field.'' --David G. Stork, Ricoh Innovations, California, Amazon [Review] TH̀̀E book on Kolmogorov Complexity.'' --Lance Fortnow, University of Chicago, IL, Amazon [Review]
- Language
- eng
- Edition
- 3rd ed.
- Extent
- 1 online resource (xxiii, 790 pages)
- Contents
-
- Preliminaries
- Algorithmic Complexity
- Algorithmic Prefix Complexity
- Algorithmic Probability
- Inductive Reasoning
- The Incompressibility Method
- Resource-Bounded Complexity
- Physics, Information, and Computation
- Isbn
- 9780387339986
- Label
- An introduction to Kolmogorov complexity and its applications
- Title
- An introduction to Kolmogorov complexity and its applications
- Statement of responsibility
- Ming Li, Paul Vitányi
- Language
- eng
- Summary
- This ongoing bestseller, now in its third edition, is considered the standard reference on Kolmogorov complexity, a modern theory of information that is concerned with information in individual objects. New key features and topics in the 3rd edition: * New results on randomness * Kolmogorov's structure function, model selection, and MDL * Incompressibility method: counting unlabeled graphs, Shellsort, communication complexity * Derandomization * Kolmogorov complexity versus Shannon information, rate distortion, lossy compression, denoising * Theoretical results on information distance * The similarity metric with applications to genomics, phylogeny, clustering, classification, semantic meaning, question-answer systems *Quantum Kolmogorov complexity Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in all fields of science. It is self-contained: it contains the basic requirements from mathematics, probability theory, statistics, information theory, and computer science. Included are history, theory, new developments, a wide range of applications, numerous (new) problem sets, comments, source references, and hints to solutions of problems. This is the only comprehensive treatment of the central ideas of Kolmogorov complexity and their applications. Lì̀ and Vitányi have provided an ideal book for the exploration of a deep, beautiful and important part of computer science.'' -- Juris Hartmanis, Turing Award Winner 1993, Cornell University, Ithaca, NY. Th̀̀e book is likely to remain the standard treatment of Kolmogorov complexity for a long time.'' -- Jorma J. Rissanen, IBM Research, California. Th̀̀e book of Li and Vitányi is unexcelled.'' -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts "The book is outstanding ... the authors did their job unbelievably well ... necessary reading for all kinds of readers from undergraduate students to top authorities in the field."--Vladimir A. Uspensky and Alexander K. Shen, Journal of Symbolic Logic [Review] Cà̀reful and clear introduction to a subtle and deep field.'' --David G. Stork, Ricoh Innovations, California, Amazon [Review] TH̀̀E book on Kolmogorov Complexity.'' --Lance Fortnow, University of Chicago, IL, Amazon [Review]
- Cataloging source
- GW5XE
- http://library.link/vocab/creatorDate
- 1955 July 16-
- http://library.link/vocab/creatorName
- Li, Ming
- Dewey number
- 511.3
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA267.7
- LC item number
- .L5 2008
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
- Vitányi, P. M. B
- Series statement
- Texts in computer science
- http://library.link/vocab/subjectName
-
- Kolmogorov complexity
- Kolmogorov complexity
- Informatique
- Kolmogorov complexity
- Kolmogorov-integralen
- Complexiteit
- Informatietheorie
- Label
- An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi
- Bibliography note
- Includes bibliographical references (pages 723-763) and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Preliminaries -- Algorithmic Complexity -- Algorithmic Prefix Complexity -- Algorithmic Probability -- Inductive Reasoning -- The Incompressibility Method -- Resource-Bounded Complexity -- Physics, Information, and Computation
- Control code
- 325001831
- Dimensions
- unknown
- Edition
- 3rd ed.
- Extent
- 1 online resource (xxiii, 790 pages)
- Form of item
- online
- Isbn
- 9780387339986
- Lccn
- 2008923041
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-0-387-49820-1
- Other physical details
- illustrations.
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-0-387-33998-6
- Specific material designation
- remote
- System control number
- (OCoLC)325001831
- Label
- An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi
- Bibliography note
- Includes bibliographical references (pages 723-763) and index
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Color
- multicolored
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Preliminaries -- Algorithmic Complexity -- Algorithmic Prefix Complexity -- Algorithmic Probability -- Inductive Reasoning -- The Incompressibility Method -- Resource-Bounded Complexity -- Physics, Information, and Computation
- Control code
- 325001831
- Dimensions
- unknown
- Edition
- 3rd ed.
- Extent
- 1 online resource (xxiii, 790 pages)
- Form of item
- online
- Isbn
- 9780387339986
- Lccn
- 2008923041
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other control number
- 10.1007/978-0-387-49820-1
- Other physical details
- illustrations.
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-0-387-33998-6
- Specific material designation
- remote
- System control number
- (OCoLC)325001831
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/An-introduction-to-Kolmogorov-complexity-and-its/qbUh1F_LnVM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/An-introduction-to-Kolmogorov-complexity-and-its/qbUh1F_LnVM/">An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/An-introduction-to-Kolmogorov-complexity-and-its/qbUh1F_LnVM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/An-introduction-to-Kolmogorov-complexity-and-its/qbUh1F_LnVM/">An introduction to Kolmogorov complexity and its applications, Ming Li, Paul Vitányi</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>