Scott Aaronson on Computability and Provability

This is a really good talk. See Jade on The Busy Beaver Problem.

Subscribe to Harvard CSMA.

Comments

Popular posts from this blog

Steven Johnson - So You Think You Know How to Take Derivatives?

Welsh Republic Podcast Talking With Kars Collective on Armenia Azerbaijan Conflict

Daniel Tubbenhauer on The Riemann Hypothesis and Prime Counting