東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

An introduction to Kolmogorov comple...

Li, Ming.

FindBook

Google Book

Amazon

博客來

An introduction to Kolmogorov complexity and its applications

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	An introduction to Kolmogorov complexity and its applications/ by Ming Li, Paul Vitanyi.
作者:	Li, Ming.
其他作者:	Vitanyi, Paul.
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xxiii, 834 p. :ill., digital ;24 cm.
內容註:	Preliminaries -- Algorithmic Complexity -- Algorithmic Prefix Complexity -- Algorithmic Probability -- Inductive Reasoning -- The Incompressibility Method -- Resource-Bounded Complexity -- Physics, Information, and Computation.
Contained By:	Springer eBooks
標題:	Kolmogorov complexity. -
電子資源:	https://doi.org/10.1007/978-3-030-11298-1
ISBN:	9783030112981

An introduction to Kolmogorov complexity and its applications
Li, Ming.

An introduction to Kolmogorov complexity and its applications[electronic resource] /by Ming Li, Paul Vitanyi. - 4th ed. - Cham :Springer International Publishing :2019. - xxiii, 834 p. :ill., digital ;24 cm. - Texts in computer science,1868-0941. - Texts in computer science..

Preliminaries -- Algorithmic Complexity -- Algorithmic Prefix Complexity -- Algorithmic Probability -- Inductive Reasoning -- The Incompressibility Method -- Resource-Bounded Complexity -- Physics, Information, and Computation.

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-Kučera 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. "Li and Vitanyi 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 Vitanyi is unexcelled." -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts.

ISBN: 9783030112981

Standard No.: 10.1007/978-3-030-11298-1doiSubjects--Topical Terms:

1004330
Kolmogorov complexity.

LC Class. No.: QA267.7 / .L56 2019

Dewey Class. No.: 511.3

An introduction to Kolmogorov complexity and its applications
LDR:03727nmm a2200349 a 4500 001 2191989
003 DE-He213
005 20190619221632.0
006 m d
007 cr nn 008maaau
008 200506s2019 gw s 0 eng d
020 $a 9783030112981 $q (electronic bk.)
020 $a 9783030112974 $q (paper)
024 7 $a 10.1007/978-3-030-11298-1 $2 doi
035 $a 978-3-030-11298-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.7 $b .L56 2019
072 7 $a PBW $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBW $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA267.7 $b .L693 2019
100 1 $a Li, Ming. $3 559294
245 1 3 $a An introduction to Kolmogorov complexity and its applications $h [electronic resource] / $c by Ming Li, Paul Vitanyi.
250 $a 4th ed.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xxiii, 834 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts in computer science, $x 1868-0941
505 0 $a Preliminaries -- Algorithmic Complexity -- Algorithmic Prefix Complexity -- Algorithmic Probability -- Inductive Reasoning -- The Incompressibility Method -- Resource-Bounded Complexity -- Physics, Information, and Computation.
520 $a 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-Kučera 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. "Li and Vitanyi 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 Vitanyi is unexcelled." -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts.
650 0 $a Kolmogorov complexity. $3 1004330
650 1 4 $a Applications of Mathematics. $3 890893
650 2 4 $a Coding and Information Theory. $3 891252
650 2 4 $a Theory of Computation. $3 892514
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Statistical Theory and Methods. $3 891074
650 2 4 $a Pattern Recognition. $3 891045
700 1 $a Vitanyi, Paul. $3 3411829
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Texts in computer science. $3 1567573
856 4 0 $u https://doi.org/10.1007/978-3-030-11298-1
950 $a Computer Science (Springer-11645)