Programme de la deuxième journée

L’héritage d’Alan Turing : logique, calcul et complexité

3 Juillet 2012 / Amphithéâtre Mérieux à l’ENS de Lyon

09:00 – 09:30 Accueil
09:30 – 10:30 Conférence de L. Valiant, School of Engineering and Applied Sciences, Harvard University, USA

Machine Learning and Beyond

10:30 – 11:00 Pause
11:00 – 12:00 Conférence de Peter Bürgisser, University of Paderborn, Germany

Prospects for Geometric Complexity Theory

12:00 – 13:00 Conférence de Martin Hyland, King’s College, Cambridge

Logic, abstract mathematics and the science of information: an unappreciated aspect of the heritage of Turing.

13:00 – 14:30 Repas dans l’atrium
14:30 – 15h30 Conférence de Daniele Micciancio, University of California, San Diego

On the hardness of computing the minimum distance of lattices and codes

15:30 – 16:30 Conférence de Erich Kaltofen, North Carolina State University, Raleigh

Complexity Theory and Symbolic Computation

16:30 – 17:00 Pause
17:00 – 18:00 Conférence de Manuel Bodirsky, CNRS, Laboratoire d’Informatique de l’École Polytechnique, France

Constraint Satisfaction: Finite Model Theory meets Infinite Model Theory

18:30 – 20:00 Vins & Fromages

Comments are closed.