Autor(es)

Verónica Becher and Pablo Ariel Heiber and Theodore A Slaman

URL Pública

Abstract

We give an algorithm to compute an absolutely normal number so that the first n digits in its binary expansion are obtained in time polynomial in n; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.