DIMACS and Penn Computational Biology Group Distinguished Lecture


Using DNA to Compute


Richard J. Lipton
Princeton University


216, Moore School
Department of Computer and Information Sciences
University of Pennsylvania


4:30 - 6:00 PM
Tuesday, April 25, 1995


Last November Len Adleman showed how to use DNA to do a special case the famous Travelling Salesman Problem (TSP). I then showed how to do essentially any NP problem. Since then there has been great interest and speculation on exactly what is the power of DNA based computers. I will try in this talk to answer the question: Can DNA based computers really compute millions of times faster than conventional electronic ones. I will also attempt to summarize what is known already about DNA computers.
Document last modified on April 24, 1995