Len Adleman
| Leonard Adleman | |
|---|---|
 |
|
| Born |
Leonard Max Adleman December 31, 1945 San Francisco, California, US |
| Nationality | American |
| Alma mater | University of California, Berkeley |
Leonard Adleman (born December 31, 1945) is an American computer scientist. He is one of the creators of the RSA encryption algorithm, for which he received the 2002 Turing Award, often called the Nobel prize of Computer science. He is also known for the creation of the field of DNA computing.
Adleman was born in California. He grew up in San Francisco and attended the University of California, Berkeley, where he received his BA degree in mathematics in 1968 and his Ph.D. degree in EECS in 1976. He was also the mathematical consultant on the movie Sneakers. He is a member of the National Academy of Engineering and the National Academy of Sciences.
Adleman is also an amateur boxer and has sparred with James Toney.
In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA as a computational system. In it, he solved a seven-node instance of the Hamiltonian Graph problem, an NP-complete problem similar to the travelling salesman problem. While the solution to a seven-node instance is trivial, this paper is the first known instance of the successful use of DNA to compute an algorithm. DNA computing has been shown to have potential as a means to solve several other large-scale combinatorial search problems.
...
Wikipedia