Kolmogorov Complexity and Algorithmic Randomness
Shen, A.; Uspensky, V. A.; Vereshchagin, N.
ISBN 10: 1470470640 ISBN 13: 9781470470647
Editore: American Mathematical Society, 2022
Usato
Brossura
Da
GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 6 aprile 2009
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
Unread book in perfect condition. Codice articolo 44565753
Riassunto:
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 "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Kolmogorov Complexity and Algorithmic ...
Casa editrice: American Mathematical Society
Data di pubblicazione: 2022
Legatura: Brossura
Condizione: As New