For more information about this meeting, contact Stephen Simpson.
|Title:||Strong Jump-Traceability I : the Computably Enumerable Case|
|Speaker:||Peter Cholak, Notre Dame|
|We will explore the relation between reals with low initial segment complexity as measured by Kolmogorov complexity and reals with low computational power (as measured by the halting set relative to the real).
A handout is available at http://www.math.psu.edu/clemens/Logic/cholak_handout.pdf|
Room Reservation Information
|Date:||11 / 13 / 2007|
|Time:||02:30pm - 03:45pm|