The author leonard m adleman received a phd in

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: -century, biology and computer science have blossomed, and there can be little doubt that they will be central to our scientific and economic progress in the new millennium. But biology and computer science—life and computation—are related. I am confident that at their interface great discovSA eries await those who seek them. The Author LEONARD M. ADLEMAN received a Ph.D. in computer science in 1976 from the University of California, Berkeley. In 1977 he joined the faculty in the mathematics department at the Massachusetts Institute of Technology, where he specialized in algorithmic number theory and was one of the inventors of the RSA publickey cryptosystem. (The “A” in RSA stands for “Adleman.”) Soon after joining the computer science faculty at the University of Southern California, he was “implicated” in the emergence of computer viruses. He is a member of the National Academy of Engineering. Further Reading Molecular Computation of Solutions to Combinatorial Problems. Leonard M. Adleman in Science, Vol. 266, pages 1021–1024; November 11, 1994. On the Path to Computation with DNA. David K. Gifford in Science, Vol. 266, pages 993–994; November 11, 1994. DNA Solution of Hard Computational Problems. Richard J. Lipton in Science, Vol. 268, pages 542–545; April 28, 1995. Additional information on DNA computing can be found at http:// on the World Wide Web. Computing with DNA Scientific American August 1998 61 Copyright 1998 Scientific American, Inc....
View Full Document

This note was uploaded on 11/28/2011 for the course COMP 790 taught by Professor Staff during the Fall '08 term at UNC.

Ask a homework question - tutors are online