Our Super Omegas: Limit-computable, yet still more random than ?, the halting probability of a TM
KE(?n) << KM(?n) ~ n (following Chaitin)
Theorem 3.3: Exists x, computable in the limit, with KG(x) << KE(x).
Proof uses EOM and
Previous slide
Next slide
Back to first slide
View graphic version
Back to
J. Schmidhuber
's
Kolmogorov page