Is every countably infinite language recursive?

Question

We'll say the alphabet for the languages is finite, say {0,1}.

score 5 · Accepted Answer · answered May 13 '16 at 14:27

5

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.

answered May 13 '16 at 14:27

David Richerby

82,470
26
145
239

Is every countably infinite language recursive?

1 Answers1