| |
|
This field was initially developed by Leonard Adleman of the University of Southern California. In 1994, Adleman demonstrated a proof-of-concept use of DNA as form of computation which was used to solve the travelling salesman problem. In addition, Bernhard Yurke (Bell Labs) has developed DNA motors. Since the initial Adleman experiments advances has been made, and various Turing machines has been proved to be constructable.
There are works over one dimensional lengths, bidimensional tiles, and even three dimensional DNA graphs processing. As of 2004 there is no known application for DNA computing that is able to utilize its incredible parallelism capabilities. The input/output interfaces still slow and expensive.