DNA experiments are proposed to solve the famous "SAT" problem of computer science. This is a special case of a more general method that can solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA-based computing. It has the potential to yield vast speedups over conventional electronic-based computers for such search problems.
No takes yet. Share an insight, caveat, or question.
Richard J. Lipton (1995) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: