There is a theory called Kolmogorov Complexity(KC) which has been initiated by Chaitin,Solomonoff,and Kolmogorov.An object is simple if it's KC is shorter,it is related to recursive function or computability theory,or uncomputabilty ,See Kolmogorov complexity and it's application by Ming Li and Vitanyi for the exact definition and examples. It may be what you are looking for.
XL _At_Here_There
- 3.1k
- 17
- 31