Good videos, with context.

Possibility is different from practicality

Computability & complexity videos

Computability videos ask what a formal system can express. Complexity asks what resources a computation needs. Keep those questions apart when a surprising demonstration claims that an unlikely medium can compute anything.

A conceptual connection and a deliberately unusual machine

Wadler’s propositions-as-types presentation connects reasoning and programs. The PowerPoint demonstration asks what counts as a universal computational medium. Choose the first for ideas that connect languages to logic; choose the second for a concrete challenge to intuition. In either case, write down the allowed operations and the representation of state before accepting the conclusion.

Choose a starting point

Questions to take into the video

Turing completeness does not imply convenience, useful speed or that a finite real-world installation has unlimited memory.

Explore a connected subject

Logic & formal methods ↗Compilers, interpreters & program analysis ↗
Sources and selection notes

By . Updated . We compared source-video titles, available uploader descriptions and the linked archive records. The choice of starting points and viewing questions is our editorial guidance. These notes do not claim full-video viewing or independent expert review.

The complete list below preserves the October 31, 2026 snapshot and its original score order. Its labels and summaries include AI-generated source material; topic membership is broader than our selected starting points. Availability and factual claims can change. Suggest a correction.

All 34 videos in this archive topic

Browse the full snapshot after choosing your starting point.