YoVDO

Stanford Lecture - Don Knuth - "A Conjecture That Had To Be True"

Offered By: Stanford University via YouTube

Tags

Theoretical Computer Science Courses Mathematics Courses Algorithm Analysis Courses Computational Complexity Courses Combinatorial Geometry Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a fascinating Stanford lecture by renowned computer scientist Donald Knuth on combinatorial geometry and mathematical conjectures. Delve into Knuth's extensive calculations related to a curious problem in the field, uncovering an amazing formula that seemed destined to be universally true. Learn about the intriguing sequel to this mathematical journey as Knuth shares his insights on a conjecture that appeared impossible to refute. Gain valuable knowledge from the "father" of algorithm analysis, author of The Art of Computer Programming, and creator of TeX typesetting system, as he presents his 23rd Annual Christmas Tree Lecture at Stanford University in 2017.

Syllabus

Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)


Taught by

Stanford Online

Tags

Related Courses

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera