Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
DNA computing
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Capabilities == DNA computing is a form of [[parallel computing]] in that it takes advantage of the many different molecules of DNA to try many different possibilities at once.<ref> {{Cite journal|last1=Lewin|first1=D. I.|year=2002|title=DNA computing|journal=Computing in Science & Engineering|volume=4|issue=3|pages=5β8|bibcode=2002CSE.....4c...5L|doi=10.1109/5992.998634}} </ref> For certain specialized problems, DNA computers are faster and smaller than any other computer built so far. Furthermore, particular mathematical computations have been demonstrated to work on a DNA computer. DNA computing does not provide any new capabilities from the standpoint of [[Computability theory (computer science)|computability theory]], the study of which problems are computationally solvable using different models of computation. For example, if the space required for the solution of a problem grows exponentially with the size of the problem ([[EXPSPACE]] problems) on [[von Neumann architecture|von Neumann machines]], it still grows exponentially with the size of the problem on DNA machines. For very large EXPSPACE problems, the amount of DNA required is too large to be practical.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)