ESP Biography



MICHAEL FORBES, MIT grad student studying theory comp science



Major: EECS

College/Employer: MIT

Year of Graduation: G

Picture of Michael Forbes

Brief Biographical Sketch:

Michael studied mathematics as an undergraduate at MIT and decided to stay for a PhD in theoretical computer science. He enjoys pacing around his room pondering the mysteries of complexity theory.



Past Classes

  (Clicking a class title will bring you to the course's section of the corresponding course catalog)

M3992: A Gentle Introduction to the P versus NP Problem in Splash! 2010 (Nov. 20 - 21, 2010)
The P versus NP question is one of the most fundamental open questions in theoretical computer science (and mathematics). We will use two concepts from graph theory: Eulerian and Hamiltonian cycles, to give some intuition about this problem. Specifically, define the problem, explain its importance, and give some idea why it may be hard to solve.