[Next] [Previous] [Up] [Top] [Contents]
6 Relation to other definitions of complexity
Computational complexity is the amount of computational resource (usually time or memory) that it takes to solve a class of problem*1. Thus the difficulty here is the limited supply of these resources once the appropriate program is supplied. This is now a very well studied measure*2. For our purposes this is a weak definition of complexity as applied to evolving entities, as the time to perform a program or the space that the program (e.g. DNA) takes is often not a very pressing difficulty compared with the problem of providing the program itself (through evolution).
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