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

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 th

SUBMITTER: Nicolau DV 

PROVIDER: S-EPMC4791004 | biostudies-literature | 2016 Mar

REPOSITORIES: biostudies-literature