[Next] [Previous] [Up] [Top] [Contents]

6 Relation to other definitions of complexity

6.2 Kolmogorov Complexity


This is the minimum length of a Turing machine program needed to generate a pattern and has thus been discussed above (
Section 4.3). It is used by several authors (e.g. [12, 15, 22]) to talk about the complexity of organisms. This is a weak definition of complexity because it corresponds to the difficulty of compression of a representation which is limited by storage difficulties. This difficulty has little direct connection with the practical aspects of a functioning organism, and is presumably used because it is a well-understood formalism.


What is Complexity? - The philosophy of complexity per se with application to some examples in evolution - 14 JUN 95
[Next] [Previous] [Up] [Top] [Contents]

Generated with CERN WebMaker