Leonard Max Adleman (born December 31, 1945) is a theoretical computer scientist and professor of computer science and molecular biology at the University of Southern California. He is known for being a co-inventor of the RSA (Rivest-Shamir-Adleman) cryptosystem in 1977, and of DNA computing. RSA is in widespread use in security applications, including digital signatures.
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 traveling 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.
In 2002, he and his research group managed to solve a 'nontrivial' problem using DNA computation. Specifically, they solved a 20-variable 3-SAT problem having more than 1 million potential solutions. They did it in a manner not unlike 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.
ACM Turing Award
For his contribution to the invention of the RSA cryptosystem, Adleman was a recipient along with Ron Rivest and Adi Shamir of the 2002 ACM Turing Award, often called the Nobel Prize of Computer Science.
He is one of the original discovers of the Adleman-Pomerance-Rumely primality test.
Adleman was the mathematical consultant on the movie Sneakers.
He has three children Jennifer (b. 1980) Stephanie (b. 1984) and Lindsey (b. 1987).
Biomatic Algorithm Ontology
Adelman demonstrated one type of potential algorithmic process that is possible in biology. These are the gene splicing genetic algorithms. In terms of systems engineering this is what amounts to a subsystem within a complex hierarchical information processing system.
Histone proteins and their computational functioning.
Protein networks functioning as hardware components (Network of Gates and Flip-flops)
Cytoskeletal Automaton Model (Microtubules)
There are certainly more classes yet to be defined, not excluding Quantum as well as Astrophysical levels.