0
$\begingroup$

Is the set of all non-recursively enumerable languages uncountable or countable? Proof? (I would assume it is uncountable but not sure.)

1 Answers 1

1

HINT: There are uncountably many languages total, and only countably many r.e. languages, so . . .

(More generally, it's a good rule of thumb that "most" languages aren't "simple".)

  • 0
    Noah: thanks for the hint. I see it now. – 2017-01-19