Moreover, when we get to intractability, or the theory of NP-completeness, we'll be using reductions there fast, to argue that a problem like L prime can't be solved faster than the problem L. There are more powerful forms of reduction that let us reach the same conclusion. 