Browse Lessons

17: Principal Components Analysis_ - Intro to Neural Computation

6: Dendrites - Intro to Neural Computation

5: Hodgkin-Huxley Model Part 2 - Intro to Neural Computation

2: Resistor Capacitor Circuit and Nernst Potential - Intro to Neural Computation

14: Rate Models and Perceptrons - Intro to Neural Computation

4: Hodgkin-Huxley Model Part 1 - Intro to Neural Computation

18: Recurrent Networks - Intro to Neural Computation

3: Resistor Capacitor Neuron Model - Intro to Neural Computation

15: Matrix Operations - Intro to Neural Computation

13: Spectral Analysis Part 3 - Intro to Neural Computation

16: Basis Sets - Intro to Neural Computation

20: Hopfield Networks - Intro to Neural Computation

8: Spike Trains - Intro to Neural Computation

7: Synapses - Intro to Neural Computation

19: Neural Integrators - Intro to Neural Computation

1. Artificial Intelligence and Machine Learning

2. Cyber Network Data Processing; AI Data Architecture

Thinking Like an Economist with Prof. Jonathan Gruber (S1:E9)

Learning to Fly with Drs. Philip Greenspun & Tina Srivastava (S1:E8)

Welcome for Volunteers (for EarthDNA's Climate 101)

Climate 101 Live

S1E7: Unpacking Misconceptions about Language & Identities with Prof. Michel DeGraff

Spring 2020 Update from Dean Rajagopal

Special Episode: Teaching Remotely During Covid-19 with Prof. Justin Reich

1. A bridge between graph theory and additive combinatorics

14. Graph limits I: introduction

25. Structure of set addition V: additive energy and Balog-Szemerédi-Gowers theorem

4. Forbidding a subgraph III: algebraic constructions

12. Pseudorandom graphs II: second eigenvalue

21. Structure of set addition I: introduction to Freiman's theorem

22. Structure of set addition II: groups of bounded exponent and modeling lemma

13. Sparse regularity and the Green-Tao theorem

6. Szemerédi's graph regularity lemma I: statement and proof

16. Graph limits III: compactness and applications

9. Szemerédi's graph regularity lemma IV: induced removal lemma

11. Pseudorandom graphs I: quasirandomness

19. Roth's theorem II: Fourier analytic proof in the integers

2. Forbidding a subgraph I: Mantel's theorem and Turán's theorem

15. Graph limits II: regularity and counting

23. Structure of set addition III: Bogolyubov's lemma and the geometry of numbers

20. Roth's theorem III: polynomial method and arithmetic regularity

24. Structure of set addition IV: proof of Freiman's theorem

5. Forbidding a subgraph IV: dependent random choice

7. Szemerédi's graph regularity lemma II: triangle removal lemma

18. Roth's theorem I: Fourier analytic proof over finite field

3. Forbidding a subgraph II: complete bipartite subgraph

17. Graph limits IV: inequalities between subgraph densities

8. Szemerédi's graph regularity lemma III: further applications