## Formally describable x computable by nonhalting GTM program such that each bit eventually stabilizes forever. I may not be able to predict when -- less restrictive than traditional computability, more restrictive than arithmetic / analytic hierarchy (Rogers - Kurtz, Kucera)

## Describable probabilities: | P(prefix) - GTM(t, prefix) | < ? for t>t0

Previous slide | Next slide | Back to first slide | View graphic version |

Back to J. Schmidhuber's Kolmogorov page