Skip to main content

Algorithmic Shortcuts

Tim Roughgarden

11:29 minute excerpt from the lecture How Algorithms Outsmart Complexity

Professor Tim Roughgarden demonstrates why exhaustive search fails for shortest-path problems, showing how binary choices create exponential growth that overwhelms even modern computers.

Read Transcript › Watch Full Lecture › Watch on YouTube ›

From the Course

Computation as a Universal and Fundamental Concept

Computation as a Universal and Fundamental Concept

Watch Videos

TIM ROUGHGARDEN treats computation as a law of nature, tracing its arc from Turing's proof that some problems are unsolvable to the P versus NP question at the heart of modern computer science.

more excerpts

Paradoxical Supertasks Nietzsche's Death of God Kant: How Your Mind Builds Reality