An Introduction to Kolmogorov Complexity a...

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

68,25 €

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:

Beschreibung

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.

Über den Autor

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."

Zusammenfassung

Inhaltsverzeichnis

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

Details

Erscheinungsjahr:	2014
Fachbereich:	Allgemeines
Genre:	Importe , Mathematik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Reihe:	Texts in Computer Science
Inhalt:	xxiii 790 S.
ISBN-13:	9781489984456
ISBN-10:	1489984453
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Li, Ming Vitányi, Paul M. B.
Auflage:	Third Edition 2008
Hersteller:	Springer Springer US, New York, N.Y. Texts in Computer Science
Verantwortliche Person für die EU:	Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße:	254 x 178 x 44 mm
Von/Mit:	Ming Li (u. a.)
Erscheinungsdatum:	25.11.2014
Gewicht:	1,511 kg