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

£71.66

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
Price: 71.66 GBP
Availability: InStock

Applied Mathematics

It has never been this cheap. We have no record of a lower price.

£72 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 54 days · 54 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 54 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £72 (39 days, 72.2%)

Price range: £72 - £74

Price levels: 2 different prices over 54 days

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 > Science, Nature & Maths > Mathematics > Applied Mathematics
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)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

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

Selected Works I: Mathematics and Mechanics: 25 (Springer Collected Works in Mathematics)

Kolmogorov's Heritage in Mathematics

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

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Selected Works II: Probability Theory and Mathematical Statistics: 26 (Mathematics and its Applications, 26)

Selected Works I: Mathematics and Mechanics: 25 (Mathematics and its Applications, 25)

Mathematical Foundations of Computer Science

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Universal Compression and Retrieval: 274 (Mathematics and Its Applications, 274)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Springer Advances in Computational Science and Engineering