For more information about this meeting, contact Stephen Simpson.
| Title: | Old and New Results on Algorithmic Equivalence Relations |
|---|
| Seminar: | Logic Seminar |
|---|
| Speaker: | Jan Reimann, University of California at Berkeley |
|---|
| Abstract Link: | http://www.math.berkeley.edu/~reimann/ |
|---|
| Abstract: |
|---|
| Borel equivalence relations arising from recursion theoretic
reducibilities seem to exhibit a stubborn resistance to complete
classification. One reason may be seen in the fact that they relate to
deep recursion theoretic problems, first and foremost Martin's
Conjecture on degree invariant functions. I will present some recent
progress on the classification of several recursion theoretic
equivalence relations. |
Room Reservation Information
| Room Number: | MB315 |
|---|
| Date: | 03 / 16 / 2010 |
|---|
| Time: | 02:30pm - 03:45pm |
|---|
