Scott Aaronson on Computability and Provability

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

Subscribe to Harvard CSMA.