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

John Searle's Chinese Room Argument

Tensor Fields and Simplicial Complexes

FUTO FUBS