Normal numbers and algorithmic randomnes:a historical sketch

What does it mean to say that a fixed infinite string is random? In this article we will attempt to trace the history of this question and the fundamental role of computability theory in our understanding of randomness. In particular, we will describe Turing's observations on the notion of normal numbers and their construction and how that connects up with algorithmic randomness.