227videosMIT RES.6-012 Introduction to Probability, Spring 2018
MIT OpenCourseWarePlaylist · 227 videos · 28 h 42 min
6.57M subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.

Gilbert Strang's first lecture of MIT 18.06: the geometry of linear equations.

Patrick Winston's MIT lecture on how to speak: openings, structure, slides and closings.

Lecture 1A of Abelson and Sussman's 1986 Structure and Interpretation of Computer Programs course: what computer science is about, and an introduction to Lisp.

Lecture 1 of MIT 18.404 Theory of Computation by Michael Sipser: finite automata, regular languages and regular expressions.

MIT 8.04 Quantum Physics I, lecture 1: superposition, introduced through experiments with 'hardness' and 'color'.
45:39MIT 6.006, lecture 1: The course's model of computation, what correctness and efficiency mean, and asymptotic notation.
52:23MIT 6.006, lecture 10: Depth-first search, reachability, topological sort and cycle detection.
49:20MIT 18.06, lecture 10: The four fundamental subspaces of a matrix and their dimensions.
51:26MIT 6.0001, lecture 10: Measuring program efficiency and an introduction to big-O.
45:56MIT 18.06, lecture 11: Matrix spaces, rank-one matrices and an application to small-world graphs.
49:13MIT 6.0001, lecture 11: Common complexity classes from constant to exponential.
57:33MIT 6.006, lecture 11: Weighted shortest paths, the relaxation framework and DAG shortest paths.
57:40MIT 6.006, lecture 12: Bellman-Ford on graphs with negative weights and how it detects negative cycles via graph duplication.
47:57MIT 18.06, lecture 12: Incidence matrices of graphs and networks, linking the four subspaces to Kirchhoff's laws.
48:32MIT 6.0001, lecture 12: Search and sorting algorithms, from bisection search to merge sort.
57:22MIT 6.006, lecture 13: Dijkstra's algorithm, why it needs non-negative weights, and its running time with different priority queues.
56:53MIT 6.006, lecture 14: All-pairs shortest paths and Johnson's algorithm's reweighting trick.
49:48MIT 18.06, lecture 14: Orthogonal vectors and subspaces, and why the row space is orthogonal to the nullspace.
57:18MIT 6.006, lecture 15: The SRTBOT framework for designing dynamic programs, worked through Fibonacci, DAG paths and the bowling problem.
48:51MIT 18.06, lecture 15: Projecting a vector onto a line and onto a subspace.
58:44MIT 6.006, lecture 16: Dynamic programming on subsequences: longest common subsequence, longest increasing subsequence and coin games.
48:05MIT 18.06, lecture 16: Projection matrices and fitting a line by least squares.
1:03:45MIT 6.006, lecture 17: DP with expanded subproblems: all-pairs shortest paths via Floyd-Warshall, optimal parenthesization and piano fingering.
1:03:45MIT 6.006, lecture 18: Rod cutting, subset sum and what pseudopolynomial running time means.
49:12MIT 18.06, lecture 18: The defining properties of determinants and the rules that follow from them.
59:09MIT 6.006, lecture 19: Complexity classes P, NP, EXP, reductions and NP-completeness at an introductory level.
53:17MIT 18.06, lecture 19: The big formula for determinants and cofactor expansion.
43:31MIT 6.0001, lecture 2: Branching with if/else and iteration with while and for loops.
50:18MIT 6.006, lecture 2: The difference between interfaces and data structures, linked lists, and how dynamic arrays get amortized constant-time appends.
47:42MIT 18.06, lecture 2: Gaussian elimination written as multiplication by elimination matrices, and when elimination breaks down.
51:01MIT 18.06, lecture 20: Cramer's rule, the inverse-matrix formula and the determinant as volume.
51:50MIT 18.06, lecture 22: Diagonalization and computing powers of a matrix, with Fibonacci as the example.
51:03MIT 18.06, lecture 23: Solving linear differential equations with eigenvalues and the matrix exponential.
47:52MIT 18.06, lecture 26: Complex matrices, Hermitian matrices and the fast Fourier transform.
50:40MIT 18.06, lecture 27: Positive definite matrices, the tests for them and their link to minima.
46:49MIT 18.06, lecture 3: Four ways to multiply matrices and how Gauss-Jordan elimination computes an inverse.