## 1. Run FAST until x first computed in PHASE Kt(x). Set n(x) := size of smallest found program for x.

## 2. S?(x) := sum of contributions to S(x) of all PHASEs up to number Kt(x)+n(x)+1-log ?

## 3. Halt, since |S?(x) -S(x) | < ? S(x)

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

Back to J. Schmidhuber's Theory of Everything page