Formally describable distributions
n-th element xn drawn with unknown probability µ(xn | x<n).
Formally describable means: there is a possibly nonhalting program that takes x<n and any possible xn as an input and whose output converges onto µ(xn | x<n)
To elaborate on this, let us introduce generalized Turing machines
Back to J. Schmidhuber's Theory of Everything page