IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v414y2001i6862d10.1038_35106533.html
   My bibliography  Save this article

Programmable and autonomous computing machine made of biomolecules

Author

Listed:
  • Yaakov Benenson

    (Weizmann Institute of Science, Rehovot 76100, Israel
    Weizmann Institute of Science)

  • Tamar Paz-Elizur

    (Weizmann Institute of Science)

  • Rivka Adar

    (Weizmann Institute of Science)

  • Ehud Keinan

    (Department of Chemistry and Institute of Catalysis Science and Technology Technion – Israel Institute of Technology
    The Scripps Research Institute)

  • Zvi Livneh

    (Weizmann Institute of Science)

  • Ehud Shapiro

    (Weizmann Institute of Science, Rehovot 76100, Israel
    Weizmann Institute of Science)

Abstract

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 μl 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.

Suggested Citation

  • Yaakov Benenson & Tamar Paz-Elizur & Rivka Adar & Ehud Keinan & Zvi Livneh & Ehud Shapiro, 2001. "Programmable and autonomous computing machine made of biomolecules," Nature, Nature, vol. 414(6862), pages 430-434, November.
  • Handle: RePEc:nat:nature:v:414:y:2001:i:6862:d:10.1038_35106533
    DOI: 10.1038/35106533
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/35106533
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1038/35106533?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kumar S. Ray & Mandrita Mondal, 2016. "Logical Inference by DNA Strand Algebra," New Mathematics and Natural Computation (NMNC), World Scientific Publishing Co. Pte. Ltd., vol. 12(01), pages 29-44, March.
    2. Anne M. Luescher & Andreas L. Gimpel & Wendelin J. Stark & Reinhard Heckel & Robert N. Grass, 2024. "Chemical unclonable functions based on operable random DNA pools," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    3. Zachary R. Adam & Albert C. Fahrenbach & Betul Kacar & Masashi Aono, 2018. "Prebiotic Geochemical Automata at the Intersection of Radiolytic Chemistry, Physical Complexity, and Systems Biology," Complexity, Hindawi, vol. 2018, pages 1-21, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:nature:v:414:y:2001:i:6862:d:10.1038_35106533. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.