國立虎尾科技大學 |

An Introduction to Kolmogorov Complexity and Its Applications

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	An Introduction to Kolmogorov Complexity and Its Applications/ by Ming Li, Paul Vitányi.
作者:	Li, Ming.
其他作者:	Vitányi, Paul.
面頁冊數:	XXIII, 834 p. 1 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Applied mathematics. -
電子資源:	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 Vitányi. - 4th ed. 2019. - XXIII, 834 p. 1 illus.online resource. - 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 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.” -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts.

ISBN: 9783030112981

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

1069907
Applied mathematics.

LC Class. No.: T57-57.97

Dewey Class. No.: 519

An Introduction to Kolmogorov Complexity and Its Applications
LDR:04029nam a22003975i 4500 001 1005392
003 DE-He213
005 20200705023118.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030112981 $9 978-3-030-11298-1
024 7 $a 10.1007/978-3-030-11298-1 $2 doi
035 $a 978-3-030-11298-1
050 4 $a T57-57.97
072 7 $a PBW $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBW $2 thema
082 0 4 $a 519 $2 23
100 1 $a Li, Ming. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 898736
245 1 3 $a An Introduction to Kolmogorov Complexity and Its Applications $h [electronic resource] / $c by Ming Li, Paul Vitányi.
250 $a 4th ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXIII, 834 p. 1 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 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.” -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts.
650 0 $a Applied mathematics. $3 1069907
650 0 $a Engineering mathematics. $3 562757
650 0 $a Coding theory. $3 561460
650 0 $a Information theory. $3 595305
650 0 $a Computers. $3 565115
650 0 $a Algorithms. $3 527865
650 0 $a Statistics . $3 1253516
650 0 $a Pattern recognition. $3 1253525
650 1 4 $a Applications of Mathematics. $3 669175
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Statistical Theory and Methods. $3 671396
650 2 4 $a Pattern Recognition. $3 669796
700 1 $a Vitányi, Paul. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1298843
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030112974
776 0 8 $i Printed edition: $z 9783030112998
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-030-11298-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)