Skip to content
hackertubeai

Harvard CMSA

Scott Aaronson | How Much Math Is Knowable?

About this video

Scott Aaronson's Harvard CMSA talk traces what mathematical truths are knowable, from Godel and Turing to the Busy Beaver function. He covers recent work on Busy Beaver values.

Keep your curiosity going.

A few more ideas from the same corner of the archive.

Vectors | Chapter 1, Essence of linear algebra

3Blue1Brown

Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich

Confreaks

But what is the Fourier Transform? A visual introduction.

3Blue1Brown

But what is a neural network? | Deep learning chapter 1

3Blue1Brown