An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science) - Image 1

Price loading...

Springer An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Name: An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
Brand: Springer

AI & Machine Learning

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

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.

Key Features

An Introduction to Kolmogorov Complexity and Its Applications

Product type: ABIS BOOK

Brand: Springer

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3030112977
Category: Books > Subjects > Computing & Internet > Computer Science > AI & Machine Learning
Domain: Amazon UK
Release Date: 26 June 2019
Listed Since: 07 December 2018

Barcode

No barcode data available

Springer An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Aspects of Kolmogorov Complexity the Physics of Information (River Publishers Series in Information Science and Technology)

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Introduction to Information Theory and Data Compression (Applied Mathematics)

Selected Works III: Information Theory and the Theory of Algorithms: 27 (Mathematics and its Applications, 27)

Selected Works III: Information Theory and the Theory of Algorithms (Springer Collected Works in Mathematics)

Information and Communication Theory (IEEE Series on Digital & Mobile Communication)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Computational Complexity: A Conceptual Perspective

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Information and Complexity in Statistical Modeling (Information Science and Statistics)

Language Computability and Formal Language Theory

Algorithmic Information Theory for Physicists and Natural Scientists (IOP ebooks)

Computability Theory: An Introduction to Recursion Theory

Combinatorial Algebra: Syntax and Semantics (Springer Monographs in Mathematics)

The Foundations of Computability Theory

Algorithmic Complexity and Telecommunication Problems

The Complexity Theory Companion (Texts in Theoretical Computer Science. An EATCS Series)

Distributed Computing Through Combinatorial Topology

Advances in Unconventional Computing: Volume 1: Theory: 22 (Emergence, Complexity and Computation, 22)

Springer Computational Invariant Theory: 130 Mathematics Book

Incomplete Information: Rough Set Analysis: 13 (Studies in Fuzziness and Soft Computing, 13)