Coding theorems: PE vs KE
Theorem 5.3: For x ? B#:
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
Kolmogorov page