Scott Aaronson | How Much Math Is Knowable?
Harvard CMSA1 HN recommender · recommended in 1 month, 2025-2025
58K views · 1 year ago · lecture · evergreen
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.
Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
34:00Math's Fundamental Flaw
Veritasium
30.8M views • 5 years ago
10:44P vs. NP and the Computational Complexity Zoo
hackerdashery
3.7M views • 12 years ago
6:14Turing & The Halting Problem - Computerphile
Computerphile
919K views • 12 years ago
42:43"Propositions as Types" by Philip Wadler
Strange Loop Conference
143K views • 11 years ago
1:00:341. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare
626K views • 5 years ago
1:14:48The Future of Mathematics?
Microsoft Research
116K views • 7 years ago
51:32Great Impractical Ideas in Computer Science: PowerPoint Programming
Tom Wildenhain
2.2M views • 7 years ago
7:42Extremely Large Numbers 1 - Introduction
Giroux Studios
20K views • 11 years ago
1:02:34MIT Godel Escher Bach Lecture 1
jasonofthel33t
557K views • 13 years ago
1:02:15Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
Fullstack Academy
227K views • 9 years ago
10:00SICP / What is "Computer Science" ?
LarryNorman
131K views • 20 years ago
59:2328c3: The Science of Insecurity
28c3
42K views • 14 years ago
3:26:34David Beazley - Lambda Calculus from the Ground Up - PyCon 2019
PyCon 2019
52K views • 7 years ago
5:34On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
1.2M views • 9 years ago
1:07:02Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)
Stanford Online
30K views • 8 years ago
3:38:43Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234
Lex Fridman
4.8M views • 5 years ago
1:07:22Invited Talk - Guy Steele
ClojureTV
39K views • 9 years ago
56:58Philip Wadler - Propositions as Types (Lambda Days 2016)
Erlang Solutions
20K views • 10 years ago
57:32Five Stages of Accepting Constructive Mathematics - Andrej Bauer
Institute for Advanced Study
34K views • 10 years ago
1:34:42The Great Debate @ARITH23: John Gustafson and William Kahan
dancefan
4K views • 10 years ago
3 comments from Hacker News
An interesting thing about this is that they figured out a high-level description of what this Busy Beaver program is doing - it's computing a Collatz-like sequence until it terminates. I'm not sure if that is described in this paper, but I learned about it in this Scott Aaronson talk, ▶ this video e.g see the slide at 31:40.
Scott Aaronson | How Much Math Is Knowable? [Harward CMSA]: ▶ this video Recently on HN (couple of months ago): link
Feature Request: Can we have dark mode for videos? An AI OS should be able to understand and satisfy such a usecases. E.g. Scott Aaronson | How Much Math Is Knowable? ▶ this video The video slides could be converted into a dark mode for night viewing.