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..
| Medienart: |
Artikel |
|---|
| Erscheinungsjahr: |
2016 |
|---|---|
| Erschienen: |
2016 |
| Enthalten in: |
Zur Gesamtaufnahme - year:2016 |
|---|---|
| Enthalten in: |
Proceedings of the National Academy of Sciences of the United States of America - (2016), Online 22 February 2016 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Nicolau, Dan V [VerfasserIn] |
|---|
| Links: |
|---|
| Förderinstitution / Projekttitel: |
|
|---|
| PPN (Katalog-ID): |
OLC1974313638 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1974313638 | ||
| 003 | DE-627 | ||
| 005 | 20230714185904.0 | ||
| 007 | tu | ||
| 008 | 160430s2016 xx ||||| 00| ||eng c | ||
| 028 | 5 | 2 | |a PQ20160430 |
| 035 | |a (DE-627)OLC1974313638 | ||
| 035 | |a (DE-599)GBVOLC1974313638 | ||
| 035 | |a (PRQ)swepub_primary_oai_lup_lub_lu_se_88219710 | ||
| 035 | |a (KEY)0583363920160000000000000000parallelcomputationwithmolecularmotorpropelledagen | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 500 |q DNB |
| 082 | 0 | 4 | |a 570 |q AVZ |
| 084 | |a LING |2 fid | ||
| 084 | |a BIODIV |2 fid | ||
| 100 | 1 | |a Nicolau, Dan V |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 ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 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. | ||
| 700 | 1 | |a Lard, Mercy |4 oth | |
| 700 | 1 | |a Korten, Till |4 oth | |
| 700 | 1 | |a van Delft, Falco C M J M |4 oth | |
| 700 | 1 | |a Persson, Malin |4 oth | |
| 700 | 1 | |a Bengtsson, Elina |4 oth | |
| 700 | 1 | |a Månsson, Alf |4 oth | |
| 700 | 1 | |a Diez, Stefan |4 oth | |
| 700 | 1 | |a Linke, Heiner |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Proceedings of the National Academy of Sciences of the United States of America |d Washington, DC : NAS, 1877 |g (2016), Online 22 February 2016 |w (DE-627)129505269 |w (DE-600)209104-5 |w (DE-576)014909189 |x 0027-8424 |7 nnns |
| 773 | 1 | 8 | |g year:2016 |g number:Online 22 February 2016 |
| 856 | 4 | 2 | |u http://lup.lub.lu.se/record/8821971 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a FID-LING | ||
| 912 | |a FID-BIODIV | ||
| 912 | |a SSG-OLC-PHY | ||
| 912 | |a SSG-OLC-CHE | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-FOR | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a SSG-OLC-DE-84 | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a SSG-OPC-FOR | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_59 | ||
| 951 | |a AR | ||
| 952 | |j 2016 |e Online 22 February 2016 | ||