Fastest way of making universes
FAST: In phase i=1,2,3Ö execute all programs p with -logP(p) + log t(p) = i.
Suppose fastest program for x computes first n bits of universe x within f(n) steps. Then FAST will take only O(f(n)) steps as well!
Compare Levinís universal search (1973)
Back to J. Schmidhuber's Theory of Everything page