What does simple mean?
Traditional: means low Kolmogorov complexity or algorithmic information.
Data x is simple if shortest program p computing x on a universal computer U is short. K(x)=min {l(p): U(p)=x}
Levin’s 1974 variant: shortest self-delimiting program (see also Chaitin 1975)
Back to J. Schmidhuber's Theory of Everything page