This website uses features that are not well-supported by your browser. Please consider upgrading to a browser and version that fully supports CSS Grid and the CSS Flexible Box Layout Module.
Sidebar image
NB: A PDF version of this announcement (suitable for posting) is also available.

Describing randomness

Johanna Franklin
Dartmouth College

Thursday, September 23, 2010
007 Kemeny Hall, 4 pm
Tea 3:30 pm, 300 Kemeny Hall

Abstract: What does it mean for an infinite binary sequence to be random? In this talk, I'll discuss three standard approaches that we can use to define randomness and show how to formalize them using recursion theory. After presenting some classical results in the area, I will show why a kind of randomness that Keng Meng Ng and I defined and studied satisfies one of our most basic intuitions. No knowledge of mathematical logic will be assumed.

This talk will be accessible to graduate students.