Recursion theory, also known as computability theory, is one of the four pillars of mathematical logic. In this talk, I will give an introduction to algorithmic computability and degrees of unsolvability. Degree of unsolvability of a set gives us its level of algorithmic unsolvability relative to other undecidable sets. We will examine the relationship between degrees of unsolvability and then discuss algorithmic randomness if time permits.