9783030112974 - an introduction to kolmogorov complexity and its applications (texts in computer science) von li, ming; vitányi, paul (4 Ergebnisse)
Sprache: Englisch
Verlag: Springer Verlag, 2019
Serie: Texts in Computer Science, Buch 48 von 83. Buch 48 von 83 - Texts in Computer Science
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 96,66
EUR 23,46 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Hardcover. Zustand: Brand New. 4th edition. 834 pages. 10.25x7.25x2.00 inches. In Stock.
Sprache: Englisch
Verlag: Springer, 2019
Serie: Texts in Computer Science, Buch 48 von 83. Buch 48 von 83 - Texts in Computer Science
- Hardcover
Anbieter: Brook Bookstore, Milano, MI, ItalienBrook Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 81,51
EUR 47,49 VersandVersand von Italien nach USAAnzahl: Mehr als 20 verfügbar
Zustand: new.
Sprache: Englisch
Verlag: Springer, 2019
Serie: Texts in Computer Science, Buch 48 von 83. Buch 48 von 83 - Texts in Computer Science
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 113,71
EUR 69,88 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 conce…pts 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-Kucera 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.
Sprache: Englisch
Verlag: Springer Verlag, 2019
Serie: Texts in Computer Science, Buch 48 von 83. Buch 48 von 83 - Texts in Computer Science
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 172,65
EUR 23,46 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Hardcover. Zustand: Brand New. 4th edition. 834 pages. 10.25x7.25x2.00 inches. In Stock.
