Gresham College Lectures cover image

How Hard is too Hard? An Introduction to Complexity - Colva Roney-Dougal

Gresham College Lectures

00:00

Computers, Turing machines and undecidability

Colva summarizes Turing's 1936 model, undecidable problems and the halting problem's implications for computation.

Play episode from 05:53
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app