# Tag Info

Subsets of recursive languages aren't always recursive or recursively enumerable. The simplest example is the language of all strings: it is clearly recursive (even regular), and all languages are its subsets including those not in $RE$. To solve this question, consider this: how many subsets does an infinite language $L$ have? What does that imply regarding ...