Lataa...

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

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Julkaisussa:J R Soc Interface
Päätekijät: Currin, Andrew, Korovin, Konstantin, Ababi, Maria, Roper, Katherine, Kell, Douglas B., Day, Philip J., King, Ross D.
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: The Royal Society 2017
Aiheet:
Linkit:https://ncbi.nlm.nih.gov/pmc/articles/PMC5378132/
https://ncbi.nlm.nih.gov/pubmed/28250099
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rsif.2016.0990
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!