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.
"Sinopsis" puede pertenecer a otra edición de este libro.
A. Shen, LIRMM CRNS, Université de Montpellier, France.
V. A. Uspensky, Lomonosov Moscow State University, Russia.
N. Vereshchagin, Lomonosov Moscow State University, Russia.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. Nº de ref. del artículo: V9781470470647
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 44565753-n
Cantidad disponible: 3 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 511 pages. 10.00x7.13x1.26 inches. In Stock. Nº de ref. del artículo: __1470470640
Cantidad disponible: 2 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FW-9781470470647
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 44565753-n
Cantidad disponible: 3 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Paperback. Condición: New. 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. Nº de ref. del artículo: LU-9781470470647
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 44565753
Cantidad disponible: 3 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: V9781470470647
Cantidad disponible: 1 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. New copy - Usually dispatched within 4 working days. Nº de ref. del artículo: B9781470470647
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 44565753
Cantidad disponible: 3 disponibles