I seem to recall that in reasonable systems of arithmetic (there's got to be an algorithm for deciding whether a statement is an axiom, and there's got to be a proof-checking algorithm, and a certain amount of arithmetic has to be provable) there are only a finite number of sequences that can be proved to be random in the Kolmogorov--Chaitin sense, although there must be infinitely sequences that are random in that sense.