Cargando…

Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA

The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial c...

Descripción completa

Detalles Bibliográficos
Autores principales: Currin, Andrew, Korovin, Konstantin, Ababi, Maria, Roper, Katherine, Kell, Douglas B., Day, Philip J., King, Ross D.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: The Royal Society 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5378132/
https://www.ncbi.nlm.nih.gov/pubmed/28250099
http://dx.doi.org/10.1098/rsif.2016.0990
_version_ 1782519403282169856
author Currin, Andrew
Korovin, Konstantin
Ababi, Maria
Roper, Katherine
Kell, Douglas B.
Day, Philip J.
King, Ross D.
author_facet Currin, Andrew
Korovin, Konstantin
Ababi, Maria
Roper, Katherine
Kell, Douglas B.
Day, Philip J.
King, Ross D.
author_sort Currin, Andrew
collection PubMed
description The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman ‘there's plenty of room at the bottom’. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world's current fastest supercomputer, while consuming a tiny fraction of its energy.
format Online
Article
Text
id pubmed-5378132
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher The Royal Society
record_format MEDLINE/PubMed
spelling pubmed-53781322017-04-10 Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA Currin, Andrew Korovin, Konstantin Ababi, Maria Roper, Katherine Kell, Douglas B. Day, Philip J. King, Ross D. J R Soc Interface Life Sciences–Engineering interface The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman ‘there's plenty of room at the bottom’. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world's current fastest supercomputer, while consuming a tiny fraction of its energy. The Royal Society 2017-03 2017-03-01 /pmc/articles/PMC5378132/ /pubmed/28250099 http://dx.doi.org/10.1098/rsif.2016.0990 Text en © 2017 The Authors. http://creativecommons.org/licenses/by/4.0/ Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.
spellingShingle Life Sciences–Engineering interface
Currin, Andrew
Korovin, Konstantin
Ababi, Maria
Roper, Katherine
Kell, Douglas B.
Day, Philip J.
King, Ross D.
Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA
title Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA
title_full Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA
title_fullStr Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA
title_full_unstemmed Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA
title_short Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA
title_sort computing exponentially faster: implementing a non-deterministic universal turing machine using dna
topic Life Sciences–Engineering interface
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5378132/
https://www.ncbi.nlm.nih.gov/pubmed/28250099
http://dx.doi.org/10.1098/rsif.2016.0990
work_keys_str_mv AT currinandrew computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna
AT korovinkonstantin computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna
AT ababimaria computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna
AT roperkatherine computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna
AT kelldouglasb computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna
AT dayphilipj computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna
AT kingrossd computingexponentiallyfasterimplementinganondeterministicuniversalturingmachineusingdna