Abstract: Disclosed is a DNA computing method of providing solutions of theorem proving with a resolution refutation. A positive literal of a clause is expressed as a base sequence while its negation is expressed as the complementary base sequence. The DNA molecules corresponding to clauses are hybridized with each other, followed by ligating the nicks of the hybrids. By use of PCR, a PCR product is obtained form with the ligated DNA molecules. The theorem proving is decided to be true if a perfect double strand of DNA is formed as measured by PAGE. The DNA molecules corresponding to the clause are of linear, branched or hairpin structures.

Abstract: Disclosed is a DNA computing method of providing solutions of theorem proving with a resolution refutation. A positive literal of a clause is expressed as a base sequence while its negation is expressed as the complementary base sequence. The DNA molecules corresponding to clauses are hybridized with each other, followed by ligating the nicks of the hybrids. By use of PCR, a PCR product is obtained form with the ligated DNA molecules. The theorem proving is decided to be true if a perfect double strand of DNA is formed as measured by PAGE. The DNA molecules corresponding to the clause are of linear, branched or hairpin structures.