The Chaitin constant can in principle be computed with exponential effort on each sucessive digit by brute forcing all programs of a given length and simply proving special theorems on each case that say if the particular program will halt or not
Can we say anything about the probability distribution of the digits themselves? are they randomly distributed in some rigorous sense?