PSU Mark
Eberly College of Science Mathematics Department

Meeting Details

For more information about this meeting, contact Stephen Simpson.

Title:Strong Jump-Traceability I : the Computably Enumerable Case
Seminar:Logic Seminar
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

Room Reservation Information

Room Number:MB106
Date:11 / 13 / 2007
Time:02:30pm - 03:45pm