Finding Hay in Haystacks: The Power and Limits of Randomness

When: Wed., Feb. 22, 6-7:30 p.m. 2017

Is the universe inherently deterministic or probabilistic? There is a remarkable variety of ways in which we utilize perfect coin tosses to our advantage: in statistics, cryptography, game theory, algorithms, gambling... Indeed, randomness seems indispensable! A computational theory of randomness, developed in the past three decades, gives surprising answers to these questions. Theoretically Speaking is a lecture series highlighting exciting advances in theoretical computer science for a broad general audience. No special background is assumed.

Price: Free

Add a review


Select a star to rate.

Anonymous and pseudonymous comments will be removed.