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
64.3k questions
77.9k answers
244k comments
80.0k users