This week our speaker is Jeffrey Hatley. He will talk to us about “Minesweeper and the Million-Dollar Math Problem.” Come listen and enjoy free pizza and soda from 5:30-6:30 in LGRT 1634!
Abstract:
One of the most important questions in mathematics and theoretical computer science today is whether P = NP; roughly speaking, this question asks whether certain problems are truly as “hard” as they appear to be. In this talk, we will make precise the definition of a “hard” problem and discuss some of the implications of a yes or no answer to the P vs. NP question. Finally, we will explain its surprising relationship to the popular computer game and procrastination tool Minesweeper.