Solving the 3-SAT problem using network-based biocomputation
The 3-Satisfiability Problem (3-SAT) is a demanding combinatorial problem, of central importance among the non-deterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence and logistics. Even with optimized algorithms, the solution space that needs to be explored grows exponentially with increasing size of 3-SAT instances. Thus, large 3-SAT instances require excessive amounts of energy to solve with serial electronic computers. Network-based biocomputation (NBC) is a multidisciplinary parallel computation approach with drastically reduced energy consumption. NBC uses biomolecular motors to propel cytoskeletal filaments through nanofabricated networks that encode the mathematical problems. By stochastically exploring possible paths through the networks, the cytoskeletal filaments find possible solutions to the encoded problem instance. Here we first report a novel algorithm that converts 3-SAT into NBC-compatible network format. We demonstrate that this algorithm works in practice, by experimentally solving four small 3-SAT instances (with up to 3 variables and 5 clauses) using the actin-myosin biomolecular motor system. This is a key step towards the broad general applicability of NBC because polynomial conversions to 3-SAT exist for a wide set of important NP-complete problems.