Can proof complexity help resolve P vs NP? | Prof. Pavel Pudlák

Picked one by one from a mixed channel. Transcript check: no transcript; both title readers certain. Channel rule: Include only full mathematical lectures and talks (e.g. named lectures, seminar-style talks on a mathematical topic) and explicit short topic explainers where a researcher explains a mathematical concept (e.g. 'What is topological order?', 'explains Four colour theorem'). Exclude programme interviews, podcasts, profiles, previews and institutional news.

A 5-minute video from Isaac Newton Institute for Mathematical Sciences: “Can proof complexity help resolve P vs NP? | Prof. Pavel Pudlák”.

Video by Isaac Newton Institute for Mathematical Sciences, played through YouTube's embedded player.