Your saves are on this device only.
Your browser may clear them at any time. You won't be able to see them on other devices. Create a free account or sign in to keep them safe in the cloud.
What makes a computational problem hard, and why forty years of work has not made most of them easy.
TalkScience & natureFree
At Royal Society.
Johan Hastad has the Royal Society Milner Award for 2026 for work spanning circuit complexity, cryptography and approximation. Complexity theory asks which problems a computer can actually solve in reasonable time and which cannot be, and his lecture covers both halves of the progress: the new algorithms, and the growing understanding of why certain problems resist them. Free, but book a ticket; doors at 18:00, lecture at 18:30.
Submit a correction for this listing.
Data is compiled from public sources including OpenStreetMap, under the ODbL. Hours change often, so check before making a journey.