10:00am - 12:00pm
Lecture

The notion of natural proof and the difficulty of showing that P ≠ NP

Timothy Gowers
Complexity theory
10:00am - 12:00pm
    Salle 5, Site Marcelin Berthelot
    Open to all, subject to availability
    -

    Speaker(s)

    Timothy Gowers

    Professor at the Collège de France

    Events

    P and NP complexity classes and NP-complete problems
    Timothy Gowers

    Lecture
    10:00am - 12:00pm

    AI and the future of mathematical practice
    Amaury Hayat

    Seminar
    2:00 - 3:00pm

    The #P class and the complexity of calculating the permanent of a 0-1 matrix
    Timothy Gowers

    Lecture
    10:00am - 12:00pm

    A Dialogical Account of Proofs in Mathematical Practice
    Catarina Dutilh Novaes

    Seminar
    2:00 - 3:00pm

    Boolean circuits and the P/poly class
    Timothy Gowers

    Lecture
    10:00am - 12:00pm

    How to Apply Category Theory: from Physics to Epidemiology
    David Corfield

    Seminar
    2:00 - 3:00pm

    Lower terminals for constant depth circuits
    Timothy Gowers

    Lecture
    10:00am - 12:00pm

    What is motivated evidence ?
    Timothy Gowers

    Seminar
    2:00 - 3:00pm

    Lower terminals for monotonic circuits
    Timothy Gowers

    Lecture
    10:00am - 12:00pm

    What does " think " mean in mathematics ?
    Frédéric Jaëck

    Seminar
    2:00 - 3:00pm

    The notion of natural proof and the difficulty of showing that P ≠ NP
    Timothy Gowers

    Lecture
    10:00am - 12:00pm

    Who Is Allowed to Participate? – On Justified epistemic Exclusions in Mathematics
    Colin Rittberg

    Seminar
    2:00 - 3:00pm

    See also

    Seminar related to the lecture: The philosophy of mathematical practice
    Timothy Gowers, chair Combinatorics
    Complexity theory