Designing in-vitro biomolecular algorithms with DNA: self-assembly and transcriptional networks

Erik Winfree
California Institute of Technology

Is biochemistry a Turing-universal model of computation? If
so, can we hope to reliably implement arbitrary algorithms by proper
design of molecules and reactions? Both answers appear to be "yes".
I will describe two models, algorithmic DNA self-assembly and RNAP
transcriptional networks, and discuss the current state of
experimental implementation, challenges, and prospects.

Back to NANO2002 Workshop I: Alternative Computing