Computability & complexity theory
Theory of computation: Turing machines, halting problem, P vs NP, complexity classes, lambda calculus, automata, Church-Turing, Goedel incompleteness, computability.
Recommended videos
- Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
- 28c3: The Science of Insecurity
- "Propositions as Types" by Philip Wadler
- Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
- Math's Fundamental Flaw
- On The Turing Completeness of PowerPoint (SIGBOVIK)
- Life in life
- Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
- All the Numbers - Numberphile
- P vs. NP and the Computational Complexity Zoo
- Ruby Manor 3 - Programming with Nothing by Tom Stuart
- David Beazley - Lambda Calculus from the Ground Up - PyCon 2019
- Great Impractical Ideas in Computer Science: PowerPoint Programming
- Matt Might - Winning the War on Error Solving the Halting Problem and Curing Cancer
- Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89
- Let's #TalkConcurrency Panel Discussion with Sir Tony Hoare, Joe Armstrong, and Carl Hewitt
- Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234
- What P vs NP is actually about
- SIGBOVIK 2007: Generalized Super Mario Bros. is NP-Complete
- 1. Introduction, Finite Automata, Regular Expressions
- MIT Godel Escher Bach Lecture 1
- I Built a COMPUTER in Magic: The Gathering
- Extremely Large Numbers 1 - Introduction
- Stephen Wolfram: Fundamental Theory of Physics, Life, and the Universe | Lex Fridman Podcast #124