Speed Limits II: Hardness, Randomness and Quantum Oracles

Deep End Era. Engineering with Sankalp · Oct 12, 2026 · 54m

Part 14 of "The Machine's Theorems". Farah and Augustin take on approximation hardness and semidefinite programming, Khot's Unique Games Conjecture ("a constraint puzzle where each clue fixes the neighbour exactly"), randomized logarithmic space, sensitivity versus block sensitivity after Hao Huang's 2019 breakthrough, parity and constant-depth quantum circuits, and the Aaronson–Kuperberg unitary synthesis problem. We read OpenAI's manuscripts in families 102 (Lean-listed, with a published reasoning summary), 103 (Lean-listed), 132 (Lean-listed), 274 (Lean-listed) and 283 (not Lean-listed)…