Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity

Rod G. Downey, Denis Roman Hirschfeldt
Avez-vous aimé ce livre?
Quelle est la qualité du fichier téléchargé?
Veuillez télécharger le livre pour apprécier sa qualité
Quelle est la qualité des fichiers téléchargés?
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.
Catégories:
Année:
2010
Editeur::
Springer
Langue:
english
Pages:
855
ISBN 10:
0387684417
ISBN 13:
9780387684413
Fichier:
PDF, 6.49 MB
IPFS:
CID , CID Blake2b
english, 2010
Ce livre ne peut être téléchargé en raison d'une plainte du titulaire d'un droit

Beware of he who would deny you access to information, for in his heart he dreams himself your master

Pravin Lal

Mots Clefs