How Hard is too Hard? An Introduction to Complexity - Colva Roney-Dougal
8,827 views
About this video
Intro · Hand-picked by a BrighterTube curator · found via University / institutional lecture channels (Gresham CollegeGresham College lecture by a St Andrews mathematician; an accessible on-ramp to a core idea of computer science.
Colva Roney-Dougal introduces computational complexity: what makes problems hard, P vs NP and why it matters.
Video by Gresham College, played through YouTube's embedded player.
Part of Gresham Lectures 2025/26