Parallel computation with molecular-motor-propelled agents in nanofabricated networks
Abstract
Electronic computers are extremely powerful at performing a high number of operations at very high speeds, sequentially. However, they struggle with combinatorial tasks that can be solved faster if many operations are performed in parallel. Here, we present proof-of-concept of a parallel computer by solving the specific instance {2, 5, 9} of a classical nondeterministic-polynomial-time complete (“NP-complete”) problem, the subset sum problem. The computer consists of a specifically designed, nanostructured network explored by a large number of molecular-motor-driven, protein filaments. This system is highly energy efficient, thus avoiding the heating issues limiting electronic computers. We discuss the technical advances necessary to solve larger combinatorial problems than existing computation devices, potentially leading to a new way to tackle difficult mathematical problems.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Feb 22, 2016
- Source ID
- 10.1073/pnas.1510825113
Entities
People
- Alf Månsson
- Dan V Nicolau
- Dan V. Nicolau Jr.
- Elina Bengtsson
- Falco C. M. J. M. Van Delft
- Heiner Linke
- Malin Persson
- Mercy Lard
- Stefan Diez
- Till Korten
Organizations
- European Commission
- Koninklijke Philips NV
- Linnaeus University
- Lund University
- Max Planck Institute of Molecular Cell Biology and Genetics
- McGill University
- Swedish Research Council
- Technische Universität Dresden
- University of Liverpool