Strong Jump-Traceability I : the Computably Enumerable Case

Logic Seminar

Meeting Details

For more information about this meeting, contact Stephen G. Simpson.

Speaker: Peter Cholak, Notre Dame

Abstract: 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

Room Number: 106 McAllister

Date: 11/13/2007

Time: 2:30pm - 3:45pm