## Speaker:

## Institution:

## Time:

## Host:

## Location:

**NOTE: Tuesday meeting**

This is the last lecture in an introductory survey of the theory of algorithmic randomness. The primary question we wish to answer is: what does it mean for a set of natural numbers, or equivalently an infinite binary sequence, to be random? We will focus on three intuitive paradigms of randomness: (i) a random sequence should be hard to describe, (ii) a random sequence should have no rare properties, and (iii) a random sequence should be unpredictable, in the sense that we should not be able to make large amounts of money by betting on the next bit of the sequence. Using ideas from computability theory, we will make each of these three intuitive notions of randomness precise and show that the three define the same class of sets.