Satisfiability problem is a famous nondeterministic polynomial-time complete (NP-complete) problem, which has always been a hotspot in artificial intelligence. In this paper, by combining the advantages of DNA origami with hybridization chain reaction, a computing model was proposed to solve the satisfiability problem. For each clause in the given formula, a DNA origami device was devised. The device corresponding to the clause was capable of searching for assignments that satisfied the clause. When all devices completed the search in parallel, the intersection of these satisfying assignments found must satisfy all the clauses. Therefore, whether the given formula is satisfiable or not was decided. The simulation results demonstrated that the proposed computing model was feasible. Our work showed the capability of DNA origami in architecting automatic computing device. The paper proposed a novel method for designing functional nanoscale devices based on DNA origami.

中文翻译：

---

基于杂交链式反应的可满足性问题DNA计算模型

可满足性问题是著名的非确定性多项式时间完备（NP-complete）问题，一直是人工智能研究的热点。本文将DNA折纸的优点与杂交链式反应相结合，提出了一种计算模型来解决可满足性问题。对于给定公式中的每个子句，设计了一个 DNA 折纸装置。与该子句对应的设备能够搜索满足该子句的分配。当所有设备并行完成搜索时，找到的这些满足赋值的交集必须满足所有子句。因此，决定了给定的公式是否可满足。仿真结果表明，所提出的计算模型是可行的。我们的工作展示了 DNA 折纸在构建自动计算设备方面的能力。该论文提出了一种基于DNA折纸设计功能纳米级器件的新方法。