Access

Letters to Nature

Nature 414, 430-434 (22 November 2001) | doi:10.1038/35106533; Received 24 January 2001; Accepted 21 September 2001

Open Innovation Challenges

naturejobs

Programmable and autonomous computing machine made of biomolecules

Yaakov Benenson1,2, Tamar Paz-Elizur2, Rivka Adar2, Ehud Keinan3,4, Zvi Livneh2 & Ehud Shapiro1,2

  1. Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel
  2. Department of Biological Chemistry, Weizmann Institute of Science, Rehovot 76100, Israel
  3. Department of Chemistry and Institute of Catalysis Science and Technology Technion – Israel Institute of Technology, Haifa 32000, Israel
  4. Department of Molecular Biology and Skaggs Institute of Chemical Biology, The Scripps Research Institute, La Jolla, California 92037, USA

Correspondence to: Ehud Shapiro1,2 Correspondence and requests for materials should be addressed to E.S. (e-mail: Email: Ehud.Shapiro@weizmann.ac.il).

Top

Devices that convert information from one form into another according to a definite procedure are known as automata. One such hypothetical device is the universal Turing machine1, which stimulated work leading to the development of modern computers. The Turing machine and its special cases2, including finite automata3, operate by scanning a data tape, whose striking analogy to information-encoding biopolymers inspired several designs for molecular DNA computers4, 5, 6, 7, 8. Laboratory-scale computing using DNA and human-assisted protocols has been demonstrated9, 10, 11, 12, 13, 14, 15, but the realization of computing devices operating autonomously on the molecular scale remains rare16, 17, 18, 19, 20. Here we describe a programmable finite automaton comprising DNA and DNA-manipulating enzymes that solves computational problems autonomously. The automaton's hardware consists of a restriction nuclease and ligase, the software and input are encoded by double-stranded DNA, and programming amounts to choosing appropriate software molecules. Upon mixing solutions containing these components, the automaton processes the input molecule via a cascade of restriction, hybridization and ligation cycles, producing a detectable output molecule that encodes the automaton's final state, and thus the computational result. In our implementation 1012 automata sharing the same software run independently and in parallel on inputs (which could, in principle, be distinct) in 120 mul solution at room temperature at a combined rate of 109 transitions per second with a transition fidelity greater than 99.8%, consuming less than 10-10 W.