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...
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 |
Ejemplares similares
-
Niépce–Bell or Turing: how to test odour reproduction
por: Harel, David
Publicado: (2016) -
Physical interactions in non-ideal fluids promote Turing patterns
por: Menou, Lucas, et al.
Publicado: (2023) -
Model reduction enables Turing instability analysis of large reaction–diffusion models
por: Smith, Stephen, et al.
Publicado: (2018) -
Testing the reproducibility and robustness of the cancer biology literature by robot
por: Roper, Katherine, et al.
Publicado: (2022) -
Free energy dissipation enhances spatial accuracy and robustness of self-positioned Turing pattern in small biochemical systems
por: Zhang, Dongliang, et al.
Publicado: (2023)