Date
Wed, 05 Oct 2022
17:00
Location
Lecture Theatre 1, Mathematical Institute, Radcliffe Observatory Quarter, Woodstock Road, OX2 6GG
Speaker
Colva Roney-Dougal
Organisation
University of St Andrews

Further Information

In 1936, Alan Turing proved the startling result that not all mathematical problems can be solved algorithmically. For those which can be, we still do not always know when there's a clever technique which could give us the answer quickly. In particular, the famous "P = NP" question asks whether, for problems where the correct solution has a proof which can easily be checked, in fact there's a quick way to find the answer.

Many difficult problems become easier if they have symmetries: finding the shortest route to deliver many parcels would be easy if all the houses were neatly arranged in a circle. This lecture will explore the interactions between symmetry and complexity.

Colva Roney-Dougal is Professor of Pure Mathematics at the University of St Andrews and Director of the Centre for Interdisciplinary Research in Computational Algebra.

Please email @email to register.

The lecture will be available on our Oxford Mathematics YouTube Channel on 12 October at 5 pm.

The Oxford Mathematics Public Lectures are generously supported by XTX Markets.

Please contact us for feedback and comments about this page. Last updated on 18 Sep 2022 18:46.