LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 18: Probability
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 18: Probability

68 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 18

Brynmor Chapman teaches this session of MIT's 6.1200J Mathematics for Computer Science, part of the Spring 2024 OpenCourseWare series. The lecture builds probability theory from first principles for a computer science audience, emphasizing rigorous step-by-step derivation over intuition, which the instructor notes often misleads beginners in this subject. Running 68 minutes, it covers the formal framework needed to reason about random processes, setting up tools used later in the course for analyzing algorithms and discrete structures. As with other lectures in the series, it assumes the mathematical background built in earlier sessions and proceeds through definitions and worked derivations on the board rather than slides. The recording is a standard MIT OCW lecture capture, licensed Creative Commons BY-NC-SA, with the full course available through MIT OpenCourseWare.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 8 m
Compared with MathematicsShorter than 61%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 16 of 2219 h 59 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN