DNA Probe Computing System for Solving NP-Complete Problems

TL;DR

This paper presents a DNA-based probe machine system that employs parallel molecular computing to efficiently solve NP-complete problems, demonstrating a novel fully parallel approach at the molecular level.

Contribution

It introduces a blocking probe technique leveraging DNA computing's parallelism, enabling solution retrieval for NP-complete problems in a single operation.

Findings

Successfully solved 3-coloring problem with DNA probes

First molecular-level fully parallel computing system

Demonstrated potential for complex problem solving

Abstract

Efficiently solving NP-complete problems-such as protein structure prediction, cryptographic decryption, and vulnerability detection-remains a central challenge in computer science. Traditional electronic computers, constrained by the Turing machine's one-dimensional data processing and sequential operations, struggle to address these issues effectively. To overcome this bottleneck, computational models must adopt multidimensional data structures and parallel information processing mechanisms. Building on our team's proposed probe machine model (a non-Turing computational framework), this study develops a blocking probe technique that leverages DNA computing's inherent parallelism to identify all valid solutions for NP-complete problems in a single probe operation. Using the 27-vertex 3-coloring problem as a case study, we successfully retrieved all solutions through DNA molecular probe experiments. This breakthrough demonstrates the first implementation of a fully parallel computing system at the molecular level, offering a novel paradigm for tackling computational complexity. Our results indicate that the probe machine, with its parallel architecture and molecular implementation, transcends the limitations of classical models and holds promise for solving intricate real-world problems.