-
Adleman represented all seven cities with strands of DNA of equal links but with different codes.
FORBES: DNA May Make Computers, Not Run Them
-
Adleman mimicked this process in the laboratory, and used it to solve something called the traveling-salesman problem.
FORBES: DNA May Make Computers, Not Run Them
-
Six years after Adleman's first experiment, DNA computers have taken many forms.
FORBES: DNA May Make Computers, Not Run Them
-
But Yurke and Adleman argue that making DNA computers to replace desktop machines may not be the point of their research after all.
FORBES: DNA May Make Computers, Not Run Them
-
By generating DNA sequences representing all possible routes and mixing them in a test tube, Dr Adleman was able to find the quickest route.
BBC: Processing power of single cells
-
But Yurke and Adleman argue that making DNA computers that could replace desktop machines may not be the point of their research after all.
FORBES: DNA May Make Computers, Not Run Them
-
What Adleman made in 1994 didn't look like a conventional computer.
FORBES: DNA May Make Computers, Not Run Them
-
And although Yurke hasn't given up on DNA computers (he's working on a DNA neural network), he is excited about this use of DNA. Leonard Adleman is too.
FORBES: DNA May Make Computers, Not Run Them
-
The field of DNA computing was kicked off in 1994 when Leonard Adleman used strands of DNA to solve a simple example of a mathematical conundrum known as the Travelling Salesman Problem.
BBC: Processing power of single cells
-
"We are still doing toy problems, " Adleman says.
FORBES: DNA May Make Computers, Not Run Them
-
Because each DNA molecule works like an individual computer, Adleman says for some problems, a DNA computer could do 100 quadrillion (1 followed by 17 zeros) operations in a single step while consuming almost no energy.
FORBES: DNA May Make Computers, Not Run Them