How Hard is too Hard? An Introduction to Complexity

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.

A lecture by Professor Colva Roney-Dougal OBE

This event is also available to watch live online. To register, visit: How Hard is too Hard? An Introduction to Complexity | Gresham College

Gresham College has offered free public lectures for over 400 years, thanks to the generosity of our supporters. We believe that everyone should have the opportunity to learn from some of the greatest minds. To support Gresham College's mission, please consider making a donation: Donate Today | Gresham College