Abstract
ABSTRACT
We consider molecular models for computing and derive a DNA-based mechanism for solving intractable problems through massive parallelism. In principle, such methods might reduce the effort needed to solve otherwise difficult tasks, such as factoring large numbers, a computationally intensive task whose intractability forms the basis for much of modern cryptography.
Key words:
DNA; nanotechnology; recombination; site-directed mutagenesis; intractability; combinatorial search; NP-completeness
Get full access to this article
View all access options for this article.