This is a special post for quick takes by ekkolápto. Only they can create top-level comments. Comments here also appear on the Quick Takes page and All Posts page.
ekkolápto's Shortform
14ekkolápto
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:
1