Summary
KG(x) << K(x) “true” information content of x
EOMs with random inputs: Universal CEMs exist, dominate universal EMs
Assume describable universes sampled from describable distribution. Then any complex universe is unlikely. Etc...
Tight coding theorem conjectures for infinite x
www.idsia.ch/~juergen everything-list@eskimo.com
Back to J. Schmidhuber's Kolmogorov page