DNA computing solves complex problems by exploiting massive parallelism: each possible solution is encoded as a DNA sequence, millions of variations are generated simultaneously, and the physical molecule that best fits the 'lock' (the puzzle) is extracted as the answer—useful for problems like the Traveling Salesman problem that don't scale on linear von Neumann machines.

factualpending

Speaker

Kevin Kelly

Evidence Quote

“rather than just do one at a time one after another it's actually doing all the solutions or all the possibilities at once”

Source

Kevin Kelly on the Future of the Web and Everything Else 3/26/2007— EconTalk
Created: 6/17/2026, 10:09:21 AM

Your notes

Loading notes...