Studying algorithms to study problems Nevanlinna Prize winner Daniel Spielman mentioned in an interview that he wants to tell people about the following philosophical ideas. One thing I want to explain is why theoretical computer scientists look like mathematicians. And … 23. Sep 2014 | By John D. Cook | 0 comments
The Talk That Wasn’t Today I had the real privilege of hearing Manuel Blum‘s talk at the Heidelberg Laureate Forum. It was about… “Wait a minute!” I hear you saying. “Manuel Blum didn’t give a talk at the forum!” … 27. Sep 2013 | By Dana Mackenzie | 1 comment