Good Characterisations, Duality Theory, and Computational Complexity


In certain areas of the mathematical sciences, and we want to think of the theory of computation as
such, measuring progress is not easy. What makes a mathematical statement good or more
interesting than another? What makes a proof of a theorem good or better than another? It is often
said that you recognize a good theorem when you see it, but that's hardly a useful definition. We
want to claim that some of the greatest contributions of the theory of computation provide precise
answers to this sort of question. Among the many incarnations that this claim can take, in this talk I
focus on the role that the theory of computational complexity can play to guide the search for better
theorems in our quest for a more understandable world.

Lecture date: 
Thursday, August 13, 2015 - 19:00 to 20:30
Auditori Poblenou