PickVidsScott Aaronson | How Much Math Is Knowable?
推荐理由
I learned about it in this Scott Aaronson talk,
说明
这是2025年由Harvard CMSA发布的一部课堂讲座，主题归在Computability & complexity theory。它讲的是busy beaver and computability这一支里的具体问题，而不是把整个领域扫一遍。适合已经能看懂基本术语、想继续往下走的人。内容上可以概括成：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.讲法不绑某一条新闻，过几年仍然可以当材料看。从2025年到2025年，有1位不同的读者在1个不同月份把它推荐出来，其中明确叫别人去看的有0次。节奏接近上课，可以暂停做笔记。它假设你愿意跟着一条推导走完。如果已经会了基本定义，就把注意力放在它怎么把busy beaver and computability变成能跟着复述的例子。
视频信息
- 频道
- Harvard CMSA
- 时长
- 1 小时 6 分
- 发布年份
- 2025
同主题更多
- Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
- 28c3: The Science of Insecurity
- "Propositions as Types" by Philip Wadler
- Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
- Math's Fundamental Flaw
- On The Turing Completeness of PowerPoint (SIGBOVIK)