Two Talks on AI - video available
Latest News
Next Mathematics Colloquium
- Colloque
Inapproximability through undecidability (Thomas VIDICK, EPFL)
Infinite combinatorial, algebraic or other structures, such as a graph, a group, or a probability space, can sometimes be approximated (in a suitable sense) by finite structures, and sometimes not. In the former case, finite approximability can provide a…
Conseil Général 7-9 / Salle 1-15, Colloque de mathématiques
- Colloque
TBA (Wolfgang LUECK, University of Bonn)
TBA Le colloque sera suivi d'un apéritif
Conseil Général 7-9 / Salle 1-15, Colloque de mathématiques
ColloqueInapproximability through undecidability (Thomas VIDICK, EPFL)
More information23.04.2026 16:15 / Conseil Général 7-9 / Salle 1-15, Colloque de mathématiques
ColloqueTBA (Wolfgang LUECK, University of Bonn)
More information21.05.2026 16:15 / Conseil Général 7-9 / Salle 1-15, Colloque de mathématiques
