Synopsis
Computability and complexity theory are two central areas of research in theoretical computer science. Until recently, most work in these areas concentrated on problems over discrete structures, but there has been enormous growth of computability theory and complexity theory over the real numbers and other continuous structures, especially incorporating concepts of "randomness." This book provides a systematic, technical development of "algorithmic randomness" and complexity. It presents concepts and results for understanding relative randomness and its relation to computational complexity. These new results are important for addressing fundamental problems in computational geometry, modeling of dynamic systems, and classical problems in numerical computations.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Algorithmic Randomness and Complexity
Image d'archives
Algorithmic Randomness and Complexity (Theory and Applications of Computability)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781493938209_new
Acheter neuf
EUR 109,92
Frais de port :
EUR 13,58
De Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Algorithmic Randomness and Complexity
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781493938209
Acheter neuf
EUR 111,22
Frais de port :
EUR 17,56
De Royaume-Uni vers Etats-Unis
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Algorithmic Randomness and Complexity
Edité par
Springer New York Aug 2016, 2016
ISBN 10 : 1493938207
ISBN 13 : 9781493938209
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of 'algorithmic randomness' and complexity for scientists from diverse fields. 884 pp. Englisch. N° de réf. du vendeur 9781493938209
Acheter neuf
EUR 106,99
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Algorithmic Randomness and Complexity
Edité par
Springer New York, 2016
ISBN 10 : 1493938207
ISBN 13 : 9781493938209
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors were awarded the 2016 Shoenfield Prize by the Association for Symbolic Logic for outstanding expository writing in the field of logicEssential resource for researchers and graduate students in theoretical computer scie. N° de réf. du vendeur 447955355
Acheter neuf
EUR 89,99
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Algorithmic Randomness and Complexity
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Algorithmic Randomness and Complexity | Rodney G. Downey (u. a.) | Taschenbuch | xxviii | Englisch | 2016 | Humana | EAN 9781493938209 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 103425700
Acheter neuf
EUR 93,45
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Algorithmic Randomness and Complexity
Edité par
Springer New York, Springer US Aug 2016, 2016
ISBN 10 : 1493938207
ISBN 13 : 9781493938209
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -Intuitively, a sequence such as 101010101010101010¿ does not seem random, whereas 101101011101010100¿, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 884 pp. Englisch. N° de réf. du vendeur 9781493938209
Acheter neuf
EUR 106,99
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Algorithmic Randomness and Complexity
Edité par
Springer New York, Springer US, 2016
ISBN 10 : 1493938207
ISBN 13 : 9781493938209
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Intuitively, a sequence such as 101010101010101010. does not seem random, whereas 101101011101010100., obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science. N° de réf. du vendeur 9781493938209
Acheter neuf
EUR 113,44
Frais de port :
EUR 66,56
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)