Coding theorems: PE vs KE
Theorem 5.3 (Schmidhuber, 2000): For x ? B#:
So complex universe histories without short enumerating description are unlikely!
Previous slide
Next slide
Back to first slide
View graphic version
Back to
J. Schmidhuber
's
Theory of Everything page