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:
Life Sciences–Engineering interface
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

Internet

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

Ejemplares similares