Program for July 3rd, 2012

Turing’s heritage: Logic, Computation & Complexity

2012, Juy 3 / Mérieux Amphitheater, ENS Lyon, France

09:00 – 09:30 Welcome
09:30 – 10:30 Invited talk by L. Valiant, School of Engineering and Applied Sciences, Harvard University, USA

Machine Learning and Beyond

10:30 – 11:00 Coffee/Tea break
11:00 – 12:00 Invited talk by Peter Bürgisser, University of Paderborn, Germany

Prospects for Geometric Complexity Theory

12:00 – 13:00 Invited talk by 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 Lunch at the atrium
14:30 – 15:30 Invited talk by Daniele Micciancio, University of California, San Diego

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

15:30 – 16:30 Invited talk by Erich Kaltofen, North Carolina State University, Raleigh

Complexity Theory and Symbolic Computation

16:30 – 17:00 Coffee/Tea break
17:00 – 18:00 Invited talk by Manuel Bodirsky, CNRS at the Laboratoire d’Informatique de l’École Polytechnique, France

Constraint Satisfaction: Finite Model Theory meets Infinite Model Theory

18:30 – 20:00 Cheese & Wine

Comments are closed.