Can I read Algorithmic Randomness and Complexity (Theory and Applications of Computability Book 0) on EtoBox?

Algorithmic Randomness and Complexity (Theory and Applications of Computability Book 0) by Rodney G. Downey, Denis R. Hirschfeldt (auth.) is a nonfiction available to read on EtoBox.

What is Algorithmic Randomness and Complexity (Theory and Applications of Computability Book 0) about?

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields. 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 random

Who reads Algorithmic Randomness and Complexity (Theory and Applications of Computability Book 0)?

Author

Rodney G. Downey, Denis R. Hirschfeldt (auth.)

Publisher

Springer Science+Business Media, LLC

Published

2010

Language

EN

ISBN

9780387571850

Category

nonfiction

Subjects

Computer Science, Mathematics, Programming