Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
A. Shen, LIRMM CRNS, Université de Montpellier, France.
V. A. Uspensky, Lomonosov Moscow State University, Russia.
N. Vereshchagin, Lomonosov Moscow State University, Russia.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Kolmogorov Complexity and Algorithmic Randomness
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9781470470647
Acheter neuf
EUR 135,19
Frais de port :
EUR 5,73
De Royaume-Uni vers Etats-Unis
Quantité disponible : 10 disponible(s)
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness
Edité par
Amer Mathematical Society, 2022
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 511 pages. 10.00x7.13x1.26 inches. In Stock. N° de réf. du vendeur __1470470640
Acheter neuf
EUR 138,68
Frais de port :
EUR 14,27
De Royaume-Uni vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness (Paperback)
Edité par
American Mathematical Society, Providence, 2017
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Paperback
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : new. Paperback. 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. Offers a textbook-style exposition of the basic notions of complexity and randomness; then covers some recent work done by participants of the Kolmogorov seminar in Moscow. The book contains numerous exercises (embedded in the text) that will help readers to grasp the material. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781470470647
Acheter neuf
EUR 166,57
Frais de port :
Gratuit
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220)
Edité par
American Mathematical Society, 2022
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Couverture souple
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 401287560
Acheter neuf
EUR 161,76
Frais de port :
EUR 7,42
De Royaume-Uni vers Etats-Unis
Quantité disponible : 3 disponible(s)
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness
Edité par
American Mathematical Society, 2022
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. New copy - Usually dispatched within 4 working days. N° de réf. du vendeur B9781470470647
Acheter neuf
EUR 152,09
Frais de port :
EUR 18,27
De Royaume-Uni vers Etats-Unis
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Algorithmic Randomness
Edité par
American Mathematical Society, US, 2017
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Paperback
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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 réf. du vendeur LU-9781470470647
Acheter neuf
EUR 170,98
Frais de port :
Gratuit
De Royaume-Uni vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Algorithmic Randomness
Edité par
American Mathematical Society, 2017
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 880961575
Acheter neuf
EUR 127,61
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs, 220)
Edité par
American Mathematical Society, 2022
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Couverture souple
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. 220th edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26396138071
Acheter neuf
EUR 173,67
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : 3 disponible(s)
Image d'archives
Kolmogorov Complexity and Algorithmic Randomness
Edité par
American Mathematical Society Jan 2017, 2017
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware. N° de réf. du vendeur 9781470470647
Acheter neuf
EUR 158,69
Frais de port :
EUR 65
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Algorithmic Randomness
Edité par
American Mathematical Society, US, 2017
ISBN 10 : 1470470640
ISBN 13 : 9781470470647
Neuf
Paperback
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : 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 réf. du vendeur LU-9781470470647
Acheter neuf
EUR 162,52
Frais de port :
EUR 74,19
De Royaume-Uni vers Etats-Unis
Quantité disponible : 5 disponible(s)