For more information about this meeting, contact Jan Reimann, Stephen Simpson.
|Title:||Right-r.e. functions and strong reducibilities|
|Speaker:||Jennifer Reimann, University of San Francisco and Pennsylvania State University|
|Kolmogorov complexity and distance functions on computable graphs are natural examples of functions that are right-r.e. These functions can be uniformly computably approximated by a sequence of functions that are pointwise non-increasing. We'll study this class of functions in the context of strong reducibilities (which we must augment for use with functions), and consider an Ershov-like hierarchy for them.|
Room Reservation Information
|Date:||11 / 15 / 2011|
|Time:||02:30pm - 03:45pm|