Journées du GT Calculabilités 2022

›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:00 (45min)

Le problème du domino apériodique en (presque) toute dimension
Benjamin Hellouin, LRI

›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