0 votes 0 votes Is every countable language recursive enumerable? Theory of Computation theory-of-computation recursive-and-recursively-enumerable-languages countable-uncountable-set + – Purple asked Jan 27, 2017 • retagged Jul 4, 2017 by Arjun Purple 598 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes No. Set of all recursive enumerable language is countable. But there are infinitely many infinite languages for which no TM exists. Out of the languages not recursive enumerable if we take any single language then its countable but not recursive enumerable. https://stackoverflow.com/questions/26950446/does-there-exist-a-tm-for-all-countable-languages smsubham answered Dec 28, 2019 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.