CALL FOR PARTICIPATION: TURING 2012
Conferences on Alan Turing's Heritage
Turing Centenary Meeting, ENS de Lyon, France
Juy 2-4, 2012
http://www.turing2012.fr/
(free registration)
**************************************************************************
VENUE:
Ecole Normale Supérieure de Lyon
Amphitheater Charles Mérieux
Lyon -- France
FREE REGISTRATION on line: http://www.turing2012.fr/
Day 1 (July 2nd 2012) -- TURING LECTURES 2012 (for a broad audience,
in French) :
* Jean Lassègue, CNRS, CREA, France
* Giuseppe Longo, CNRS, ENS Paris, france
* Gilles Dowek, INRIA, France
* J.-M. Salanskis, Université Paris-Ouest Nanterre La Défense, France
* Sophie Laplante, CNRS, Université Paris 7, France
* Gerard Berry, INRIA, Académie des sciences, France
Day 1 (July 2nd 2012) -- Leslie Valiant's award ceremony: degree
honoris causa of ENS de Lyon
Day 2 (July 3th 2012) -- CONFERENCE ON TURING'S HERITAGE: LOGIC,
COMPUTATION & COMPLEXITY (in English)
* Leslie Valiant, School of Engineering and Applied Sciences, Harvard
University, USA
* Peter Bürgisser, University of Paderborn, Germany
* Martin Hyland, King's College, Cambridge, England
* Daniele Micciancio, University of California, San Diego, USA
* Erich Kaltofen, North Carolina State University, Raleigh, USA
* Manuel Bodirsky, CNRS and Laboratoire d'Informatique de l'École
Polytechnique, France
Day 3 : (July 4th 2012) -- WORKSHOP ON COMPLEXITY & FINITE MODELS (in English)
This is the annual meeting of the French working group on complexity
and finite models (http://www.up2.fr/cmf/).
We welcome talks by resarchers from inside or outside the working
group, on topics related to finite model theory OR computational
complexity (including those complexity-theoretic topics that have no
connection to finite models).
If you want to propose a talk, please send the title of your presentation to:
Pascal Koiran (pascal.koiran@ens-lyon.fr)
or Natacha Portier (natacha.portier@ens-lyon.fr)
ORGANIZING & SCIENTIFIC COMMITTEE:
* Gilles Dowek, Deputy Scientific Director of INRIA
* Eric Fleury, Professor at ENS de Lyon, Head of the CS department
* Pascal Koiran, Professor at the CS department of ENS de Lyon
* Alexandre Miquel, Associate professor, ENS de Lyon
* Gilles Villard, Senior researcher at CNRS, Head of the CS laboratory
(LIP) at ENS de Lyon.
AIMS AND SCOPE:
Alan Turing made a unique impact on mathematics, computing, computer
science, informatics, morphogenesis, artificial intelligence, philosophy and
the wider scientific world. June 23, 2012, is the Centenary of Alan
Turing's birth.
This Turing Centenary Conference will be held in Lyon on July 2-4, 2012. The
whole conference will be composed of four main parts:
*** On the first day, 6 public lectures intended for a broad audience. These 6
lectures, in French, given by researchers in computer science, philosophy
and epistemology, will cover the influence of Turing's work on our society.
At the end of the first day, Leslie Valiant will be awarded an honorary
degree from ENS de Lyon. He is currently T. Jefferson Coolidge Professor of
Computer Science and Applied Mathematics in the School of Engineering and
Applied Sciences at Harvard University. He received the Nevanlinna Prize in
1986, the Knuth Award in 1997, the EATCS Award in 2008, and the 2010 A. M.
Turing Award. He is a Fellow of the Royal Society (London) and a member of
the National Academy of Sciences (USA).
*** On the second day, an international conference on "Turing's heritage: Logic,
Computation & Complexity" (in English) that includes 6 invited talks (see
the program on the web site http://www.turing2012.fr/)
*** and on the last day, a workshop on "complexity and finite models".
The conference is organised by the computer science department at ENS de
Lyon, the computer science research laboratory at ENS de Lyon and
the Excellence initiative laboratory in Mathematics and Computer
Science (MILYON). All talks will be recorded, live-streamed and available
online after the conference.
CONTACT: Prof. Eric Fleury at Eric.Fleury@ens-lyon.fr
==========================================================