We begin with Rice's theorem which tells us that almost every question we can ask about the recursively enumerable language is undecidable, and we then introduce a problem called post correspondence problem, which we also show as undecidable. 