Return to Revisions

There is a theory called Kolmogorov Complexity(KC,also called algorithmic information) which has been initiated by Chaitin,Solomonoff,and Kolmogorov.Roughly speaking,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.or http://www.scholarpedia.org/article/Algorithmic_complexity. It may be what you are looking for.