Great Ideas in Theoretical Computer Science - On Proofs

Great Ideas in Theoretical Computer Science - On Proofs

Ryan O'Donnell via YouTube Direct link

Open notebook mathematics

15 of 19

15 of 19

Open notebook mathematics

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Great Ideas in Theoretical Computer Science - On Proofs

Automatically move to the next video in the Classroom when playback concludes

  1. 1 15-251: Great Theoretical ideas in Computer Science Spring 2016, Lecture 1.5
  2. 2 Proposition
  3. 3 Banach-Tarski Theorem
  4. 4 What is a proof?
  5. 5 Proofs — prehistory
  6. 6 Proofs — 19th century
  7. 7 Principia Mathematica, ca. 1912
  8. 8 Classification of Finite Simple Groups
  9. 9 More anecdotes
  10. 10 Kepler Conjecture
  11. 11 Computer-assisted proof
  12. 12 Computer-formalized proofs
  13. 13 Proof of the Four Color Theorem
  14. 14 10 tips for finding proofs
  15. 15 Open notebook mathematics
  16. 16 Alternate Perspective
  17. 17 Possible complaints/points off from your TA
  18. 18 Some common induction mistakes
  19. 19 Problem: Prove 2n n for all integers n 2 1.

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.