An irrational number normal to every radix simultaneously It seems to me it is possible to write down a computer program which will output the binary bits of such a number, one by one, with at most polynomial(N) time to output the Nth bit. Essentially, the program keeps track of the counts of digits in radix B (among digits "up to the present location") for all B=2,3,...,F(N), which is order F(N)^2 counts in all. (And note, radix 4 and 8 take care of 2- and 3-tuples in radix 2, etc.) The program chooses the pattern for the next lg(N) bits "greedily" from among the N possibilities to maximize some likelihood measure of "normality up to now." Here F(N) is a sufficiently-slow-growing monotonically-increasing-to-infinity continuous positive-valued function of N, for example lg(N)^(1/4) should be fine. Apparently Alan Turing claimed to have solved essentially this problem, using an approach which sounds vaguely similar, in an unpublished manuscript which was eventually printed in his collected works. He must have solved it before world war II. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)