Date | Time | Speaker | Title | Cookies, dinner, etc. |
Thursday, September 3 | 4:00 p.m. | Isaac Goldbring, University of Illinois at Chicago | TBA | cookies/juice at 3:30/ dinner at 6 TBA |
Friday, September 4 (dept. coll.) | 4:00 p.m. (room B239) | Isaac Goldbring, University of Illinois at Chicago | TBA | |
Tuesday, September 8 | 4:00 p.m. | Rutger Kuyper, UW | TBA | cookies/juice at 3:30 |
Tuesday, September 15 | 4:00 p.m. | Ellen Chih, UW | TBA | cookies/juice at 3:30 |
Tuesday, September 22 | 4:00 p.m. | Mariya Soskova, visiting UW from University of Sofia, Bulgaria | TBA | cookies/juice at 3:30 |
Tuesday, September 29 | 4:00 p.m. | TBA | TBA | cookies/juice at 3:30 |
Tuesday, October 6 | 4:00 p.m. | Henry Townser, University of Pennsylvania, Philadelphia | TBA | cookies/juice at 3:30/ dinner at 6 TBA |
Tuesday, October 13 | 4:00 p.m. | TBA | TBA | cookies/juice at 3:30/ dinner at 6 TBA |
Tuesday, October 20 | 4:00 p.m. | Julia Knight, University of Notre Dame, Indiana | TBA | cookies/juice at 3:30/ dinner at 6 TBA |
Prerequisites: Math 770, and Math 773 or concurrent registration in Math 773
Time and Place: MWF 13:20-14:10
Textbook: none
Course Description: The Medvedev and Muchnik degrees are extensions of the Turing degrees studied in computability theory. Both of these structures also have nice substructures, namely, the degrees of the so-called effectively closed sets, which form an analogue to the computably enumerable degrees studied in the Turing degrees.
We will discuss various aspects of these structures. In particular, we will cover the following topics, including their necessary prerequisites: