Scott Aaronson recently did an in-person salon at UT Austin based on his essay: Why Philosophers Should Care About Computational Complexity. Sharing the full video of the discussion since I figured many of you may find it useful. He discussed the Busy Beaver problem, P vs. NP, Cramer’s Conjecture, philosophy of mind, and more: