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.

中文翻译：

---

DNA计算、计算复杂度和生物进化率问题

考虑了生物体进化与一些复杂计算问题（密码系统破解、图中最短路径的确定）之间的类比。结果表明，在没有关于可能的生物体物种的先验信息的情况下，这样的问题是复杂的（被评为 NP 类）并且无法在多项式步骤中解决。这一结论表明需要重新检查进化机制。讨论了进化的确定性方法的想法。