That is if there is an algorithm for L prime then there is an algorithm for L. We actually saw one example of a more complex reduction where we started by assuming that there was an algorithm for L sub U, the universal language. 