## x=x(1),x(2),x(3),… bitstrings representing history of discrete universe; x(1) big bang; x(k) state at step k. Algorithm computes x(k+1) from x(k) and rand(k) for kɭ, where rand(k) comes from some random oracle.

## Oracles allow for complex universes without short description!

## (Later: more restrictive assumption that oracle is not truly random but pseudo-random. But not necessary for the formally describable distributions next)

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

Back to J. Schmidhuber's Theory of Everything page