∂IFFERENCE
Complexity theory with discrete ODEs
Théorie de la complexité avec des équations différentielles discrètes
Program
- 10h00: Retour sur la proposition. Informations administratives. Discussions. (Olivier Bournez)
- 10h30: Recursion schemes, discrete ODEs and characterization of Polynomial Time computations (Arnaud Durand)
- 11h30: Analog computations in the cell with chemical reaction networks: from Turing completeness result to questions of low complexity classes (François Fages)
- 14h15: Automates cellulaires complétement continus (Julien Cervelle)
- 15h00: Differential equations in proof-theory: an introduction through linear logic (Marie Kerjean)
- 16h00: Relations with logic, CSP (Florent Madeleine)
- 16h45: Fonctions vs Algorithmes (Pierre Valarcher)