An example of a computable absolutely normal number

The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski's construction which produces a computable absolutely normal number.

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Verónica Becher, Santiago Figueira
• Keywords: Absolutely Normal Number, Recursive Reformulation, Sierpinski, TCS 2002, Theoretical Computer Science