The present invention relates to a DNA computing method of providing a solution to the problem theorem proving using the derived countered method (resolution refutation). The present invention also provides a method of expressing a logic section for use in DNA computing method to DNA. More specifically, the logic section representation of the method of the present invention shows a logic section, a positive logical syntax included in the regular expression to the complementary DNA nucleotide sequence for generating a predetermined DNA sequence, and the positive logic sphere sphere negative logic. One logical clause is expressed as a combination of one or more single-stranded DNA. According to the present invention DNA strands that make up the logic section may be a straight-chain structure, hairpins (hairpin) structure or a branched structure. The end result is an empty logic of deriving countered method to repeat from other logic section having a logic section and a negative logic sphere having a logical syntax to create a single draw section (resolvent) in the conventional computing method is the logical product regex while the need to ensure the generation of a section (empty clause), DNA computing method of the present invention given the nucleotide sequence and its complementary sequence hybrid is formed and simply to determine whether to generate a complete DNA double strand by the PCR amplification blank It may determine whether to generate the logic section (empty clause). Such DNA computing method of the present invention provides a method for using the logic section of the parallel processing techniques correct the theorem proving problem effectively.
展开▼
