£92.59

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Mathematical Logic

Price data last checked 90 day(s) ago - refreshing...

View at Amazon

Price History & Forecast

Last 1 days • 1 data points (No recent data available)

Historical

Generating forecast...

Not enough data points to display chart (need at least 2 points)

Price Distribution

Price distribution over 1 days • 1 price levels

Days at Price

Price Analysis

Most common price: £93 (1 days, 100.0%)

Price range: £93 - £93

Price levels: 1 different prices over 1 days

Description

Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory. The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the "Kolmogorov seminar" in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues. This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.

Product Specifications

Format: Paperback
ASIN: 1470470640
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 30 January 2017
Listed Since: 05 May 2022

Barcode

No barcode data available

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

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

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

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

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

Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)

Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)

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

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

Computability and Randomness: 51 (Oxford Logic Guides)

Introduction to Information Theory and Data Compression (Applied Mathematics)

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

Sampling in Combinatorial and Geometric Set Systems (Mathematical Surveys and Monographs)

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

Kolmogorov's Heritage in Mathematics

Combinatorics and Random Matrix Theory (Graduate Studies in Mathematics)

Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)

Universal Coding and Order Identification by Model Selection Methods (Springer Monographs in Mathematics)

Abstract Methods In Information Theory (Second Edition)

Random Summation: Limit Theorems and Applications

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Universal Coding and Order Identification by Model Selection Methods (Springer Monographs in Mathematics)

Algorithmic Probability and Combinatorics (Contemporary Mathematics): Ams Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, ... of British Columbia, Vancouver, Bc, Canada

Asymptotic Frame Theory for Analog Coding (Foundations and Trends® in Communications and Information Theory)