Dear all,
This week’s seminar will take place
** today at 2.30pm in hybrid mode (room B107 and https://bbb.lipn.univ-paris13.fr/b/sei-nlh-8vr-xvy **
Paulin de Naurois will talk about machine-free complexity.
I will only join the talk online today because I am ill but I expect to hear a lot of you there!
Best,
/t
Hi everyone,
The complexity seminar continues today, as usual:
** at 2.30pm in hybrid mode (room B107 and https://bbb.lipn.univ-paris13.fr/b/sei-nlh-8vr-xvy) **
I will talk about barriers in complexity again, hopefully covering in a single session the result known as “natural proofs” (due to Razborov and Rudich).
Next week (November 21st) should be Ulysse, talking about Kolmogorov complexity.
Best,
/t
Dear all,
This is a reminder that there is a complexity seminar planned today (for some reason it does not appear in the calendar on my phone; I will solve that as soon as possible):
** at 2.30pm in hybrid mode (room B107 and online: https://bbb.lipn.univ-paris13.fr/b/sei-nlh-8vr-xvy) **
I will not be at LIPN today but Morgan agreed (many thanks to him!) to open the room and take care of the recording.
Paulin de Naurois will be talking about « a generic proof of the Cook-Levin theorem ».
Best,
/t
