If some things can easily be solved by computer, while others are probably impossible, how complex, is complex?
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.
Time: Monday 11 May, 6pm
Tickets: Tickets are free and must be reserved in advance.