Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DNA Computing, Computation Complexity and Problem of Biological Evolution Rate

DNA Computing, Computation Complexity and Problem of Biological Evolution Rate 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Biotheoretica Springer Journals

DNA Computing, Computation Complexity and Problem of Biological Evolution Rate

Acta Biotheoretica , Volume 56 (4) – Sep 12, 2008

Loading next page...
 
/lp/springer-journals/dna-computing-computation-complexity-and-problem-of-biological-QTQoZuykc7

References (31)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media B.V.
Subject
Philosophy; Evolutionary Biology; Philosophy of Biology
ISSN
0001-5342
eISSN
1572-8358
DOI
10.1007/s10441-008-9055-8
pmid
18787960
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Acta BiotheoreticaSpringer Journals

Published: Sep 12, 2008

There are no references for this article.