Frivolous Theorem of Arithmetic(oeis.org) |
Frivolous Theorem of Arithmetic(oeis.org) |
E.g. for anything that can be put into a 1-to-1 correspondence with integers--things like computer programs, scientific hypothesis, etc, you can prove that "smaller" instances (in the sense of being mapped to smaller integers) have better chance of being bug-free, or more predictive of future observations, etc etc.
Bigger programs are composed of smaller programs, so the smaller a program is, the more likely it is to be included in, say, a standard library for that language, and the more likely it is to occur in programs written in that language.