0 votes 0 votes closed with the note: wrong que Set of all languages that are not Recursively Enumerable is uncountable. This is true. WHY? Theory of Computation theory-of-computation turing-machine + – manisha11 asked Aug 16, 2018 closed Aug 16, 2018 by manisha11 manisha11 383 views comment Share Follow See 1 comment See all 1 1 comment reply arvin commented Aug 16, 2018 reply Follow Share this will be false forever. 0 votes 0 votes Please log in or register to add a comment.