How to do CS Theory
35:51Street Fighting Mathematics
26:10Big O and friends
28:10Harmonic Numbers Asymptotics
22:18Asymptotics Tricks
25:00The Central Binomial Coefficient
1:00:26Birthday Paradox Asymptotics
18:09Factorial Asymptotics, Stirling's Formula
28:26Binomial Coefficients Asymptotics
35:57Central Limit Theorem
24:22Gaussian Random Variables
38:31Berry --Esseen Theorem
16:07Markov and Chebyshev Inequalities
38:22Proof of the Chernoff Bound
24:34Chernoff, Hoeffding, etc. bounds
17:47Computational Models: Turing Machines
25:31Computational Models: Circuits
29:07The Word RAM Model
25:30Factorial Asymptotics, Stirling's Formula
This lecture delves into the asymptotic analysis of n!, providing a partial proof and statement of Stirling's Formula. It references 'Asymptopia' by Joel Spencer.
Working out the asymptotics of n! -- proving most of Stirling's Formula, and stating the final version. Lecture 3b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
Concrete Mathematics, by Graham--Knuth--Patashnik