##
Math 873: Advanced Topics in Foundations (Fall 2015)

*The Medvedev and Muchnik Degrees*

### Materials

The following are some papers I referenced in class.

- A. Sorbi,
*The Medvedev Lattice of Degrees of Difficulty*, Computability, Enumerability, Unsolvability: Directions in Recursion Theory (S. B. Cooper, T. A. Slaman and S. S. Wainer, eds.), London Mathematical Society Lecture Notes, vol. 224, Cambridge University Press, 1996, pp. 289–312. [pdf]