Alan Turing's algorithm for producing absolutely normal numbers

In a manuscript entitled "A note on normal numbers," presumably written in 1937, Alan Turing gave a computable construction to prove that the set of absolutely normal (normal to every integer base) has full Lebesgue measure. Furthermore, he gave an explicit algorithm for producing instances in this set, thus, establishing for the first time the existence of computable absolutely normal numbers. 

I will present this seminal work of Turing.