We will discuss some recent results on reducibilities and degree structures in computability. This talk will be expository, covering the degree structures arising from several reducibilites in computability. These results are motivated by their interactions with classical computability, constructive mathematics, effective topology and reverse mathematics.