One machine please, make it Turing
summary
Explains that programming languages map to formal language classes — regular via regex/finite automata, context‑free via pushdown automata — and that compilers run lexical→syntax→semantic→optimize→codegen stages. Demonstrates concrete optimizations: constant folding and loop unrolling that uses MMX/SSE to perform four multiplications in parallel giving roughly 4× speedup. Notes practical tooling: generated lexers/parsers and alternative VMs like JRuby, TruffleRuby, LLVM for running Ruby code.
AI-written summary · about
chapters (8)
- 0:00Introduction and speaker intro
- 1:12How computers work
- 2:59Formal languages overview
- 9:50Turing machines explained
- 14:30Algorithmic complexity
- 15:14Compilers and interpreters
- 22:06Language implementation tools
- 23:54Q&A
