Recursive language with non-recursive subsets I have a professor who is really poor at explaining the material, which is what makes answering his questions very hard. Here is the question:


  Recursive language with non-recursive subsets. Does one exist?


I'm sure it is a very simple and easy answer but I can't figure it out. Don't give me the answer just point me in the right direction and I'm sure I'll figure it out.
Hint. Take a very big recursive language over any alphabet you like. Verrrry big. Something so big it has all kinds of subsets.