# Item

ITEM ACTIONSEXPORT

Released

Journal Article

#### Parallel computation with molecular-motor-propelled agents in nanofabricated networks.

##### External Resource

No external resources are shared

##### Fulltext (restricted access)

There are currently no full texts shared for your IP range.

##### Fulltext (public)

There are no public fulltexts stored in PuRe

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Nicolau Jr, D. V., Lard, M., Korten, T., Delft, F. C. M. J. M. v., Persson, M., Bengtsson, E., et al. (2016).
Parallel computation with molecular-motor-propelled agents in nanofabricated networks.* Proceedings
of the National Academy of Sciences of the United States of America,* *113*(10),
2591-2596.

Cite as: https://hdl.handle.net/21.11116/0000-0001-0331-4

##### Abstract

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.