Kolmogorov complexity
Kolmogorov complexity measures algorithmic complexity, and it’s defined by the shortest possible algorithm leading to a program.
For example, it might measure the algorithm that is formed by a series of genes producing an organ or ar organism (as originally read in here).