Turing's normal numbers: towards randomness

VERÓNICA BECHER

LECTURE NOTES IN COMPUTER SCIENCE

Springer

Lugar: Heidelberg; Año: 2012 vol. 7318 p. 35 - 45

0302-9743

In a manuscript entitled "A note on normal numbers" and written presumably in 1938 Alan Turing gave an algorithm that produces real numbers normal to every integer base. This proves, for the first time, the existence of computable normal numbers and it is the best solution to date to Borel's problem on giving examples of normal numbers. Furthermore, Turing's work is pioneering in the theory of randomness that emerged 30 years after. These achievements of Turing are largely unknown because his manuscript remained unpublished until its inclusion in his Collected Works in 1992. The present note highlights Turing's ideas for the construction of normal numbers. Turing's theorems are included with a reconstruction of the original proofs