Can we solve a 3-SAT problem with supressor logic?

From GcatWiki
Revision as of 17:44, 3 April 2009 by Eckdahl (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

What is the 3-SAT problem?

How did Sakamoto et al. use a DNA computer to solve a 3-SAT problem?

What is suppressor logic?

How could suppressor logic be used to solve the Sakamot 3-SAT problem?