Finding out whether a question is too difficult to ever solve efficiently depends on figuring out just how hard it is. Associate professor Srikanth Srinivasan, Nutan Limaye (IT University in Copenhagen) and Sébastien Tavenas (Savoy Mont Blanc University, France) have shown how to do that for a major class of problems. Their results are further elaborated in Quanta Magazine. The research paper also won "Best Paper Award" at the annual IEEE Symposium on Foundations of Computer Science (FOCS) earlier this year.

Congratulations to postdoc Jonathan Sterling, from the Logic and Semantics research group, who has received the highly prestigious Marie Sklodowska-Curie postdoc fellowship. Jonathan will be working on synthetic methods in program verification, and the aim of the project is to extend the successful STC approach to a wider class of programming models, in particular programming languages with effects.