Great Ideas in Theoretical Computer Science - On Proofs

Great Ideas in Theoretical Computer Science - On Proofs

Explore the foundations of theoretical computer science in this lecture from CMU's "Great Ideas in Theoretical Computer Science" course. Delve into the concept of proofs, tracing their evolution from prehistory to modern computer-assisted and formalized methods. Examine landmark theorems like Banach-Tarski and the Four Color Theorem, and gain insights into the classification of finite simple groups and the Kepler Conjecture. Learn 10 practical tips for constructing proofs, understand common induction mistakes, and consider alternative perspectives on mathematical reasoning. Engage with open notebook mathematics and tackle a challenging problem on proving inequalities using induction.