10-11 oct. 2022 Nancy (France)

Programme

‹ mardi 11 octobre 2022
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
›9:15 (45min)
The Coq Library of Undecidability Proofs
Dominique Larchey-Wendling, Loria
›10:00 (45min)
Embedding universal Turing machines in the dynamics of smooth maps
Alonso Herrera Nunez, Université Paul Sabatier
›10:45 (30min)
Pause
›11:15 (45min)
Rice-like theorems for automata networks
Guilhem Gamard, Loria
›12:00 (45min)
Analog characterization of FPSPACE and PSPACE
Riccardo Gozzi, LIX
›12:45 (1h15)
Déjeuner
›14:45 (45min)
Computational Complexity of Chaotic Gibbs Measures
Léo Gayral, IMT
›15:30 (30min)
Pause
›16:00 (45min)
Separating computability notions
Djamel Eddine Amir, Loria
Session
Discours
Logistique
Pause
Sortie
Personnes connectées : 1 Vie privée
Chargement...