Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the fundamental limits of mathematical knowledge through the lens of theoretical computer science in this lecture by Scott Aaronson from the University of Texas, Austin. Begin with foundational concepts including Gödel's Incompleteness Theorem and Turing's discovery of uncomputability, then delve into the spectacular Busy Beaver function that grows faster than any computable function. Examine recent groundbreaking research showing that BB(549) is independent of set theory axioms, while learning how an international collaboration proved BB(5) = 47,176,870, and consider whether BB(6) will ever be determined by humans or AI. Investigate the P≠NP conjecture and its implications for machine intelligence limitations, then discover how scalable quantum computers could expand the boundaries of mathematical knowability. Conclude by exploring hypothetical computational models beyond quantum computers that might further extend these boundaries through exotic scenarios like jumping into black holes, creating closed timelike curves, or projecting onto the holographic boundary of the universe.
