Algorithmic Randomness and Complexity
Rod G. Downey, Denis Roman Hirschfeldt
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.
سب زمرہ:
سال:
2010
ناشر کتب:
Springer
زبان:
english
صفحات:
855
ISBN 10:
0387684417
ISBN 13:
9780387684413
فائل:
PDF, 6.49 MB
IPFS:
,
english, 2010
کاپی رائٹ ہولڈر کی شکایت کی وجہ سے یہ کتاب ڈاؤن لوڈ کے لیے دستیاب نہیں ہے۔
Beware of he who would deny you access to information, for in his heart he dreams himself your master
فائل کنورٹر
مزید تلاش کے نتائج
دیگر فوائد 
![M. van Lambalgen — Random Sequences [PhD Thesis]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/78198e7ff06fcc2ce367cf9fa57fd9943d498d83c313087eec44eb1ba3f8bc3f.jpg)
