6.5420 Randomness and Computation
Repeats every week every Tuesday and every Thursday until Tue May 12 2026 except Tue Feb 17 2026, Tue Mar 24 2026, Thu Mar 26 2026.
Tue, 02/03/2026 - 11:00am to 12:30pmLocation:
32-144
Instructor:
Ronitt Rubinfeld
The power and sources of randomness in computation. Connections and applications to computational complexity, computational learning theory, cryptography and combinatorics. Topics include: probabilistic proofs, uniform generation and approximate counting, Fourier analysis of Boolean functions, computational learning theory, expander graphs, pseudorandom generators, derandomization.