This course on theoretical computer science focuses on the topic of proofs. The learning outcomes include understanding the concept of proofs, exploring the history of proofs, and learning about computer-assisted and formalized proofs. The course covers skills such as proof-writing, problem-solving, and critical thinking. The teaching method involves lectures, anecdotes, and examples. The intended audience for this course is individuals interested in theoretical computer science, mathematics, and logic.
Great Ideas in Theoretical Computer Science - On Proofs
Overview
Syllabus
15-251: Great Theoretical ideas in Computer Science Spring 2016, Lecture 1.5
Proposition
Banach-Tarski Theorem
What is a proof?
Proofs — prehistory
Proofs — 19th century
Principia Mathematica, ca. 1912
Classification of Finite Simple Groups
More anecdotes
Kepler Conjecture
Computer-assisted proof
Computer-formalized proofs
Proof of the Four Color Theorem
10 tips for finding proofs
Open notebook mathematics
Alternate Perspective
Possible complaints/points off from your TA
Some common induction mistakes
Problem: Prove 2n n for all integers n 2 1.
Taught by
Ryan O'Donnell
