Programme

Semaine Lun. 10 Mar. 11 Liste

	Lun. 10	Mar. 11
09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00 21:00 22:00 23:00	Joueurs probabilistes contre joueurs déterministes 14:00 - 14:45 (45min) Joueurs probabilistes contre joueurs déterministes Laurent Bienvenu, LaBRI A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations 14:45 - 15:30 (45min) A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations Manon Blanc, LIX Pause 15:30 - 16:00 (30min) Pause Les claviers, un nouveau modèle de calcul 16:00 - 16:45 (45min) Les claviers, un nouveau modèle de calcul Bastien Laboureix, Loria Computable analysis on the space of marked groups 16:45 - 17:30 (45min) Computable analysis on the space of marked groups Emmanuel Rauzy, Université de la Sarre Dîner 19:30 - 23:00 (3h30) Dîner	The Coq Library of Undecidability Proofs 9:15 - 10:00 (45min) The Coq Library of Undecidability Proofs Dominique Larchey-Wendling, Loria Embedding universal Turing machines in the dynamics of smooth maps 10:00 - 10:45 (45min) Embedding universal Turing machines in the dynamics of smooth maps Alonso Herrera Nunez, Université Paul Sabatier Pause 10:45 - 11:15 (30min) Pause Rice-like theorems for automata networks 11:15 - 12:00 (45min) Rice-like theorems for automata networks Guilhem Gamard, Loria Analog characterization of FPSPACE and PSPACE 12:00 - 12:45 (45min) Analog characterization of FPSPACE and PSPACE Riccardo Gozzi, LIX Déjeuner 12:45 - 14:00 (1h15) Déjeuner Le problème du domino apériodique en (presque) toute dimension 14:00 - 14:45 (45min) Le problème du domino apériodique en (presque) toute dimension Benjamin Hellouin, LRI Computational Complexity of Chaotic Gibbs Measures 14:45 - 15:30 (45min) Computational Complexity of Chaotic Gibbs Measures Léo Gayral, IMT Pause 15:30 - 16:00 (30min) Pause Separating computability notions 16:00 - 16:45 (45min) Separating computability notions Djamel Eddine Amir, Loria

Personnes connectées : 1

Vie privée