An introduction to Kolmogorov complexity and its applications / (Record no. 40427)

MARC details
000 -LEADER
fixed length control field 03202nam a22002297a 4500
003 - CONTROL NUMBER IDENTIFIER
control field CUTN
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20231120210040.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 231120b |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783030112974
041 ## - LANGUAGE CODE
Language English
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Edition number 23
Classification number 511.3
Item number MIN
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Ming, Li
245 ## - TITLE STATEMENT
Title An introduction to Kolmogorov complexity and its applications /
Statement of responsibility, etc Ming Li and Paul Vitányi
250 ## - EDITION STATEMENT
Edition statement 4th ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Switzerland :
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2019.
300 ## - PHYSICAL DESCRIPTION
Extent XXIII, 834 p.:
Other physical details ill.;
Dimensions 25 cm.
505 ## - FORMATTED CONTENTS NOTE
Contents Preliminaries<br/>Algorithmic Complexity<br/>Algorithmic Prefix Complexity<br/>Algorithmic Probability<br/>Inductive Reasoning<br/>
Title The Incompressibility Method<br/>Resource-Bounded Complexity<br/>Physics, Information, and Computatio
520 ## - SUMMARY, ETC.
Summary, etc 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. 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. "Li 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. "The book is likely to remain the standard treatment of Kolmogorov complexity for a long time." -- Jorma J. Rissanen, IBM Research, California. "The book of Li and Vitányi is unexcelled
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element algorithms
690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN)
Department Name Mathematics
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type General Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Location Shelving location Date of Cataloging Total Checkouts Full call number Barcode Date last seen Price effective from Koha item type
    Dewey Decimal Classification     Non-fiction CUTN Central Library CUTN Central Library Sciences 20/11/2023   511.3 MIN 46867 20/11/2023 20/11/2023 General Books