A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (2(20)) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of unaided human computation.
No takes yet. Share an insight, caveat, or question.
Braich et al. (2002) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: