Len Adleman, 2002 ACM Turing Award Recipient

He is actually different from many other computer scientists/mathematicians , he seems such a sweet person, talking about his children , his students ..

Only watched the first 15 minutes, but it's already made it onto my weekend "serious watch" list. Great interview thus far.

"What is the special property that RSA has that has made it so useful?". The explanation sent chills up my spine. The thinking is so clear, elegant, pure, and solid. It's based on the known facts. and that' why it's unbreakable (quantum computer aside).

Wonderful details-- also advice for life at end of video!

fantastic interview my life mirrors Dr.A bay area sf stow lake never got lost there but remember rowing around it sf city college then berkeley then medical school went into medicine as a practicing doctor he is a little older of course there were no computers while he caught up with it I stopped my math at calculus although I loved it this week I "discovered" dna computing and its fascinating I wish I could understand how he got the strands to tell him the hamiltonian path how did he get the right strands to line up? how does the double strand expand the computing aspect will just keep reading. amazing guy unusual for a math genius guy thanks,wp