How Much Math Is Knowable?

From Santa Fe Institute

Scott Aaronson, University of Texas, Austin Theoretical computer science has over the years sought more and more refined answers to the question of which mathematical truths are knowable by finite beings like ourselves, bounded in time and space and subject to physical laws. I'll tell a story that starts with Godel's Incompleteness Theorem and Turing's discovery of uncomputability. I'll then introduce the spectacular Busy Beaver function, which grows faster than any computable function. Work ...