Algorithmic randomness / Johanna N. Y. Franklin (2020) / 978-1-108-47898-4

Public ISBD Titre : Algorithmic randomness : progress and prospects Type de document : texte imprimé Auteurs : Johanna N. Y. Franklin, Éditeur scientifique ; Christopher P. Porter, Éditeur scientifique Editeur : Cambridge Année de publication : 2020 Collection : LECTURE NOTES IN LOGIC Importance : 1 vol. (X-359 p.) Présentation : Couv. coul. Format : 24 cm ISBN/ISSN/EAN : 978-1-108-47898-4 Note générale : Notes bibliogr. Langues : Anglais (eng) Langues originales : Anglais (eng) Catégories : 004 Informatique. Science et technologie de l'informatique.:004.4 Logiciel. Programme:004.42 Programmation. Programmes d'ordinateur:004.421 Algorithmes pour élaboration du programme Tags : Aléa algorithmique  Informatique théorique  Calculabilité  Complexité  Théorie de l'information  Randomité  Fondements des algorithmes. Index. décimale : 004.421.2 Résumé : "The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field" Algorithmic randomness : progress and prospects [texte imprimé] / Johanna N. Y. Franklin, Éditeur scientifique ; Christopher P. Porter, Éditeur scientifique . - Cambridge, 2020 . - 1 vol. (X-359 p.) : Couv. coul. ; 24 cm. - (LECTURE NOTES IN LOGIC) . ISBN : 978-1-108-47898-4 Notes bibliogr. Langues : Anglais (eng) Langues originales : Anglais (eng) Catégories : 004 Informatique. Science et technologie de l'informatique.:004.4 Logiciel. Programme:004.42 Programmation. Programmes d'ordinateur:004.421 Algorithmes pour élaboration du programme Tags : Aléa algorithmique  Informatique théorique  Calculabilité  Complexité  Théorie de l'information  Randomité  Fondements des algorithmes. Index. décimale : 004.421.2 Résumé : "The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field"

Exemplaires(0)

Disponibilité
aucun exemplaire

---

1 (1 - 1 / 1) Par page : 25 50 100 200