### Speaker

#### Herb Dershem

Hope College

Computer Science

616-395-7508

dershem@cs.hope.edu

An Interesting Talk about Uninteresting Numbers

How do we determine that a given number is random? In fact, once it is given, how can it be considered random? This talk explores what it means for a number to be random, following the lead of Gregory Chaitin's algorithmic randomness. We will explore the consequences of this view of randomness and look at the astounding and interesting properties of Chaitin's related constant, Omega.