David Naccache - Prof at Paris II University Télécom ParisTech Soc
Date: January 18th 2012 Location: Eurecom - Eurecom
David Naccache is visiting us this Wednesday the 18th. He proposes an informal seminar on the Gödel's incompleteness theorems and their relationship with cryptography. He will first explain how the same mathematical object, the product of small prime numbers, is important in cryptography, coding theory and computer sciences. He will explain and prove the incompleteness theorem in a very simple and easy to follow way, even without any previous knowledge in cryptography, coding theory nor logic. Always wanted to understand Gödel's theorem? This talk is for you.