Login
Lecture, Barnard's Inn Hall, Monday, 11 May 2026 - 18:00
How Hard is too Hard? An Introduction to Complexity
Need help registering?
Some mathematical problems can easily be solved on a computer, whilst some are probably impossible. Complexity theory is how we analyse difficulty, and one of the most famous open problems in mathematics is the question of whether P = NP: if the answer to a problem is easy to check, is the problem actually easy to solve? This lecture introduces the work of Alan Turing and other pioneers in the subject, before bringing us up-to-date with some recent progress.
This is the Annual lecture hosted with the London Mathematical Society.
Support Gresham
Gresham College has offered an outstanding education to the public free of charge for over 400 years. Today, Gresham College plays an important role in fostering a love of learning and a greater understanding of ourselves and the world around us. Your donation will help to widen our reach and to broaden our audience, allowing more people to benefit from a high-quality education from some of the brightest minds.
