Acta Biotheoretica 56 (4):285-295 (2008)

An analogy between the evolution of organisms and some complex computational problems (cryptosystem cracking, determination of the shortest path in a graph) is considered. It is shown that in the absence of a priori information about possible species of organisms such a problem is complex (is rated in the class NP) and cannot be solved in a polynomial number of steps. This conclusion suggests the need for re-examination of evolution mechanisms. Ideas of a deterministic approach to the evolution are discussed.
Keywords Philosophy   Evolutionary Biology   Philosophy of Biology
Categories (categorize this paper)
DOI 10.1007/s10441-008-9055-8
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,259
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Algorithmic Information Theory.Peter Gacs - 1989 - Journal of Symbolic Logic 54 (2):624-627.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
35 ( #327,397 of 2,518,718 )

Recent downloads (6 months)
1 ( #408,070 of 2,518,718 )

How can I increase my downloads?


My notes