Help


from Wikipedia
« »  
The algorithm proceeds as follows.
Given the first n digits of Ω and a k ≤ n, the algorithm enumerates the domain of F until enough elements of the domain have been found so that the probability they represent is within 2 < sup >-( k + 1 )</ sup > of Ω.
After this point, no additional program of length k can be in the domain, because each of these would add 2 < sup >- k </ sup > to the measure, which is impossible.
Thus the set of strings of length k in the domain is exactly the set of such strings already enumerated.

2.028 seconds.