We'll say the alphabet for the languages is finite, say {0,1}.
Is every countably infinite language recursive?
formal languages;uncountability
Every language over a finite alphabet is countable so your question is just is every language recursive? The undecidability of the halting problem shows that there are non-recursive languages.