Mathematics & Theoretical CS

Computability & complexity theory

Computability & complexity theory sits within Mathematics & Theoretical CS. Approach the subject through definitions, worked reasoning, and the connections that make an abstract idea useful. This selection contains 34 catalog videos from 29 distinct channels. The examples below offer specific entry points into the subject, with their own vocabulary and scope, rather than a prescribed sequence of lessons.

Recurring catalog topics include lambda calculus, cellular automata, functional programming, turing completeness, computation and game of life. These tags describe overlapping directions within the collection; an individual video may connect several of them. Recorded formats include comedy, demo, explainer, interview, lecture, music, podcast, talk and tutorial. Use those differences to choose between approaches to the subject and to compare how different contributors frame related questions.

“"Propositions as Types" by Philip Wadler”, listed under Strange Loop Conference, is cataloged as talk. Philip Wadler's Strange Loop talk on Propositions as Types, the link between logic and computation (the Curry-Howard correspondence). He traces its history through Church, Godel and Turing and shows how it shaped…

“Let's #TalkConcurrency Panel Discussion with Sir Tony Hoare, Joe Armstrong, and Carl Hewitt”, listed under Erlang Solutions, is cataloged as talk. A panel with Tony Hoare, Joe Armstrong and Carl Hewitt, hosted by Francesco Cesarini, on the history and future of concurrency. The three creators of CSP, Erlang and the actor model discuss…