Parallel computation with molecular-motor-propelled agents in nanofabricated networks
The combinatorial nature of many important mathematical problems, including nondeterministic-polynomial-time (NP)-complete problems, places a severe limitation on the problem size that can be solved with conventional, sequentially operating electronic computers. There have been significant efforts in conceiving parallel-computation approaches in the past, for example: DNA computation, quantum computation, and microfluidics-based computation. However, these approaches have not proven, so far, to be scalable and practical from a fabrication and operational perspective. Here, we report the foundations of an alternative parallel-computation system in which a given combinatorial problem is encoded into a graphical, modular network that is embedded in a nanofabricated planar device. Exploring the network in a parallel fashion using a large number of independent, molecular-motor-propelled agents then solves the mathematical problem. This approach uses orders of magnitude less energy than conventional computers, thus addressing issues related to power consumption and heat dissipation. We provide a proof-of-concept demonstration of such a device by solving, in a parallel fashion, the small instance {2, 5, 9} of the subset sum problem, which is a benchmark NP-complete problem. Finally, we discuss the technical advances necessary to make our system scalable with presently available technology.
| Errataetall: |
CommentIn: Proc Natl Acad Sci U S A. 2016 Jun 7;113(23 ):E3188. - PMID 27226290 |
|---|---|
| Medienart: |
E-Artikel |
| Erscheinungsjahr: |
2016 |
|---|---|
| Erschienen: |
2016 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:113 |
|---|---|
| Enthalten in: |
Proceedings of the National Academy of Sciences of the United States of America - 113(2016), 10 vom: 08. März, Seite 2591-6 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Nicolau, Dan V [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
Biocomputation |
|---|
| Anmerkungen: |
Date Completed 18.07.2016 Date Revised 13.11.2018 published: Print-Electronic CommentIn: Proc Natl Acad Sci U S A. 2016 Jun 7;113(23 ):E3188. - PMID 27226290 Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1073/pnas.1510825113 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM257733310 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM257733310 | ||
| 003 | DE-627 | ||
| 005 | 20231224183455.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231224s2016 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1073/pnas.1510825113 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n0859.xml |
| 035 | |a (DE-627)NLM257733310 | ||
| 035 | |a (NLM)26903637 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Nicolau, Dan V |c Jr |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Parallel computation with molecular-motor-propelled agents in nanofabricated networks |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 18.07.2016 | ||
| 500 | |a Date Revised 13.11.2018 | ||
| 500 | |a published: Print-Electronic | ||
| 500 | |a CommentIn: Proc Natl Acad Sci U S A. 2016 Jun 7;113(23 ):E3188. - PMID 27226290 | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a The combinatorial nature of many important mathematical problems, including nondeterministic-polynomial-time (NP)-complete problems, places a severe limitation on the problem size that can be solved with conventional, sequentially operating electronic computers. There have been significant efforts in conceiving parallel-computation approaches in the past, for example: DNA computation, quantum computation, and microfluidics-based computation. However, these approaches have not proven, so far, to be scalable and practical from a fabrication and operational perspective. Here, we report the foundations of an alternative parallel-computation system in which a given combinatorial problem is encoded into a graphical, modular network that is embedded in a nanofabricated planar device. Exploring the network in a parallel fashion using a large number of independent, molecular-motor-propelled agents then solves the mathematical problem. This approach uses orders of magnitude less energy than conventional computers, thus addressing issues related to power consumption and heat dissipation. We provide a proof-of-concept demonstration of such a device by solving, in a parallel fashion, the small instance {2, 5, 9} of the subset sum problem, which is a benchmark NP-complete problem. Finally, we discuss the technical advances necessary to make our system scalable with presently available technology | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a Research Support, Non-U.S. Gov't | |
| 650 | 4 | |a NP complete | |
| 650 | 4 | |a biocomputation | |
| 650 | 4 | |a molecular motors | |
| 650 | 4 | |a nanotechnology | |
| 650 | 4 | |a parallel computing | |
| 700 | 1 | |a Lard, Mercy |e verfasserin |4 aut | |
| 700 | 1 | |a Korten, Till |e verfasserin |4 aut | |
| 700 | 1 | |a van Delft, Falco C M J M |e verfasserin |4 aut | |
| 700 | 1 | |a Persson, Malin |e verfasserin |4 aut | |
| 700 | 1 | |a Bengtsson, Elina |e verfasserin |4 aut | |
| 700 | 1 | |a Månsson, Alf |e verfasserin |4 aut | |
| 700 | 1 | |a Diez, Stefan |e verfasserin |4 aut | |
| 700 | 1 | |a Linke, Heiner |e verfasserin |4 aut | |
| 700 | 1 | |a Nicolau, Dan V |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Proceedings of the National Academy of Sciences of the United States of America |d 1915 |g 113(2016), 10 vom: 08. März, Seite 2591-6 |w (DE-627)NLM000008982 |x 1091-6490 |7 nnns |
| 773 | 1 | 8 | |g volume:113 |g year:2016 |g number:10 |g day:08 |g month:03 |g pages:2591-6 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1073/pnas.1510825113 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 113 |j 2016 |e 10 |b 08 |c 03 |h 2591-6 | ||