Algorithmic Randomness and Complexity by Rodney G. Downey (.PDF)
File Size: 5 MB
Algorithmic Randomness and Complexity (Theory and Applications of Computability Book 0) by Rodney G. Downey, Denis R. Hirschfeldt
Requirements: .PDF reader, 5 MB
Overview: 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.
Genre: Non-Fiction > Tech & Devices
Free Download links: