Can we solve a 3-SAT problem with supressor logic?
From GcatWiki
Revision as of 17:53, 3 April 2009 by
Eckdahl
(
talk
|
contribs
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to:
navigation
,
search
Contents
1
What is the 3-SAT problem?
2
How did Sakamoto et al. use a DNA computer to solve a 3-SAT problem?
3
What is suppressor logic?
4
How could suppressor logic be used to solve the Sakamoto 3-SAT problem?
What is the 3-SAT problem?
How did Sakamoto et al. use a DNA computer to solve a 3-SAT problem?
Sakamoto et al.
What is suppressor logic?
How could suppressor logic be used to solve the Sakamoto 3-SAT problem?
Navigation menu
Views
Page
Discussion
View source
History
Personal tools
Log in
Navigation
Main page
Recent changes
Random page
Help
Search
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information