Algorithmic randomness and complexity
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 a...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
New York, NY :
Springer New York
[20..].
Cham : Springer Nature |
| Painos: | 1. |
| Sarja: | Theory and Applications of Computability, In cooperation with the association Computability in Europe
|
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithmic randomness and complexity, Rodney G. Downey, Denis R. Hirschfeldt, 2010, New York (N.Y.), Springer, 1 vol. (XXVIII-855 p.), Theory and applications of computability, 978-0-387-95567-4 • Algorithmic Randomness and Complexity, Texte imprimé, 9780387571850 • Algorithmic randomness and complexity, Rodney G. Downey, Denis R. Hirschfeldt, 2010, New York (N.Y.), Springer, 1 vol. (XXVIII-855 p.), Theory and applications of computability, 978-0-387-95567-4 |
Sisällysluettelo:
- Background Preliminaries Computability Theory Kolmogorov Complexity of Finite Strings Relating Complexities Effective Reals Notions of Randomness Martin-Löf Randomness Other Notions of Algorithmic Randomness Algorithmic Randomness and Turing Reducibility Relative Randomness Measures of Relative Randomness Complexity and Relative Randomness for 1-Random Sets Randomness-Theoretic Weakness Lowness and Triviality for Other Randomness Notions Algorithmic Dimension Further Topics Strong Jump Traceability ? as an Operator Complexity of Computably Enumerable Sets