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.^{[1]} He is also known for the creation of the field of DNA computing.
Biography
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.^{[1]} He was also the mathematical consultant on the movie Sneakers.^{[2]} He is a member of the National Academy of Engineering^{[3]} and the National Academy of Sciences.^{[4]}
Adleman is also an amateur boxer and has sparred with James Toney.^{[5]}
Discovery
In 1994, his paper Molecular Computation of Solutions To Combinatorial Problems described the experimental use of DNA as a computational system.^{[6]} In it, he solved a sevennode instance of the Hamiltonian Graph problem, an NPcomplete problem similar to the travelling salesman problem. While the solution to a sevennode 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 largescale combinatorial search problems.^{[7]}
In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation.^{[citation needed]} Specifically, they solved a 20variable SAT problem having more than 1 million potential solutions. They did it in a manner similar to the one Adleman used in his seminal 1994 paper. First, a mixture of DNA strands logically representative of the problem's solution space was synthesized. This mixture was then operated upon algorithmically using biochemical techniques to winnow out the 'incorrect' strands, leaving behind only those strands that 'satisfied' the problem. Analysis of the nucleotide sequence of these remaining strands revealed 'correct' solutions to the original problem.^{[1]}
He is one of the original discoverers of the Adleman–Pomerance–Rumely primality test.^{[8]}^{[9]}
Fred Cohen, in his 1984 paper, Experiments with Computer Viruses has credited Adleman with coining the term "virus".^{[10]} He is also widely referred to as the Father of DNA Computing.^{[11]}^{[12]}
Currently, Adleman is working on the mathematical theory of Strata.^{[13]}
Awards
For his contribution to the invention of the RSA cryptosystem, Adleman, along with Ron Rivest and Adi Shamir, has been a recipient of the 1996 Paris Kanellakis Theory and Practice Award and the 2002 ACM Turing Award, often called the Nobel Prize of Computer Science.^{[1]} Adleman was elected a Fellow of the American Academy of Arts and Sciences in 2006.^{[14]}
References
 ^ ^{a} ^{b} ^{c} ^{d} "Leonard M. Adleman  American computer scientist". Encyclopedia Britannica. Retrieved 20151124.
 ^ "Sneakers". www.usc.edu. Retrieved 20151124.
 ^ "NAE Website  Dr. Leonard M. Adleman". www.nae.edu. Retrieved 20151124.
 ^ "Leonard Adleman". www.nasonline.org. Retrieved 20151124.
 ^ Professor Adleman versus World Champion Boxer –
 ^ "Adleman Papers". www.usc.edu. Retrieved 20151124.
 ^ "Molecular Computation of Solutions to Combinatorial Problems" (PDF). American Association for the Advancement of Science. November 11, 1994.
 ^ Primality testing algorithms [after Adleman, Rumely and Williams], volume 901 of Lecture Notes in Mathematics. Springer Berlin. 1981.
 ^ "NAE Website  DNA Computing by SelfAssembly". www.nae.edu. Retrieved 20151124.
 ^ Cohen, Fred (1984), Computer Viruses – Theory and Experiments
 ^ http://wwwcsfaculty.stanford.edu/~eroberts/courses/soco/projects/200304/dnacomputing/adleman_bio.htm
 ^ DNA computing#History
 ^ [1]
 ^ "Book of Members, 17802010: Chapter A" (PDF). American Academy of Arts and Sciences. Retrieved 6 April 2011.
External links
Wikimedia Commons has media related to Leonard Adleman. 
 Adleman's homepage
 Turing Award Citation
 Mathematical consultant for movie Sneakers
 Leonard Adleman at the Mathematics Genealogy Project
Winners of the Paris Kanellakis Theory and Practice Award



