Kolmogorov Complexity and Algorithmic Randomness - Brossura

Shen, A.; Uspensky, V. A.; Vereshchagin, N.

 
9781470470647: Kolmogorov Complexity and Algorithmic Randomness
Brossura
ISBN 10: 1470470640 ISBN 13: 9781470470647
Casa editrice: Amer Mathematical Society, 2017

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Amer Mathematical Society
Data di pubblicazione
2017
Lingua
Inglese
ISBN 10 
1470470640
ISBN 13 
9781470470647
Rilegatura
Copertina flessibile
Numero di pagine
511
Contatto del produttore
non disponibile
Persona responsabile
non disponibile

Altre edizioni note dello stesso titolo

9781470431822: Kolmogorov Complexity and Algorithmic Randomness

Edizione in evidenza

ISBN 10:  1470431823 ISBN 13:  9781470431822
Casa editrice: Amer Mathematical Society, 2017
Rilegato