But the simplest one, and the one we need for Rice's theorem, is an algorithm that takes an input string W for one language, or a problem L, and converts it to another string X that is an input to another language or problem, L Prime. 