For more information about this meeting, contact Jan Reimann, Stephen Simpson.
| Title: | Turing equivalence as a Borel equivalence relation |
|---|
| Seminar: | Logic Seminar |
|---|
| Speaker: | Jake Pardo, Pennsylvania State University |
|---|
| Abstract: |
|---|
| The talk first presents some important facts on countable Borel equivalence relations. Feldman and Moore showed that any such relation is obtained as the orbit equivalence of some countable group action. This yields, among other things, the existence of a universal countable Borel equivalence relation.
The second part then covers a result due to Slaman and Steel: Turing equivalence is not hyperfinite, or, equivalently, it is not generated by a Z-action. |
Room Reservation Information
| Room Number: | MB315 |
|---|
| Date: | 10 / 23 / 2012 |
|---|
| Time: | 02:30pm - 03:45pm |
|---|
