An example of a computable absolutely normal number

  • Authors:

  • Verónica Becher;Santiago Figueira

  • Affiliations:

  • Univ. of Buenos Aires, Buenos Aires, Argentina;Univ. of Buenos Aires, Buenos Aires, Argentina

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 5.23

Visualization

Abstract

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.