For more information about this meeting, contact Stephen Simpson.
|Title:||Mass problems and initial segment complexity|
|Speaker:||Phil Hudelson, Pennsylvania State University|
|We present a new theorem which shows in a precise sense that one
cannot reliably extract much additional information from an infinite
sequence of 0's and 1's. We sketch some pieces of the proof, using
our notion of f-optimal covers. We discuss some consequences of our
theorem in the areas of Kolmogorov complexity and randomness.
Finally, we use our theorem to distinguish among many naturally
occurring mass problems.|
Room Reservation Information
|Date:||10 / 12 / 2010|
|Time:||02:30pm - 03:45pm|