Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)
推荐理由
it's always a pleasure for me to see Knuth's talks or read his work
强烈推荐svat · 原文
说明
这是2017年由Stanford Online发布的一部课堂讲座,主题归在Recreational & visual math。它讲的是combinatorial geometry这一支里的具体问题,而不是把整个领域扫一遍。适合已经能看懂基本术语、想继续往下走的人。内容上可以概括成:Donald Knuth's 2017 Christmas Tree Lecture at Stanford about a combinatorial geometry problem whose computed numbers matched a striking formula. He tells the story of the conjecture and its sequel.这些读者给出的理由,核心是:HN fans love it for Knuth's humor and for how he makes open math problems feel approachable, and it is often cited for details like dancing links and counting rectangle subdivisions.讲法不绑某一条新闻,过几年仍然可以当材料看。从2017年到2023年,有1位不同的读者在5个不同月份把它推荐出来,其中明确叫别人去看的有2次。节奏接近上课,可以暂停做笔记。它假设你愿意跟着一条推导走完。如果已经会了基本定义,就把注意力放在它怎么把combinatorial geometry变成能跟着复述的例子。
视频信息
- 频道
- Stanford Online
- 时长
- 1 小时 7 分
- 发布年份
- 2017