In joint work with Achilles Beros, I examine the definable complexity of natural number codes for Medvedev reductions between some important classes of Turing degrees. I will give a thorough introduction to the Medvedev hierarchy on the Turing degrees and explain the context of our results. The talk will be readily accessible to grad students who have had a basic computability theory class.