3 votes 3 votes Theory of Computation theory-of-computation recursive-and-recursively-enumerable-languages + – Shubham Sahu asked Jul 15, 2015 • retagged Jul 4, 2017 by Arjun Shubham Sahu 4.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Yes, it is. Because we can count the set of TMs. https://books.google.fr/books?id=hsxDiWvVdBcC&pg=PA281&lpg=PA281&dq=is+the+set+of+recursively+enumerable+languages+is+countable&source=bl&ots=rdGwViXpgR&sig=46GGkz-DM5-zIluIIH3F-R7ilFk&hl=en&sa=X&ved=0CCcQ6AEwAWoVChMIjMidg9vcxgIVBJQeCh2GhQvO#v=onepage&q=is%20the%20set%20of%20recursively%20enumerable%20languages%20is%20countable&f=false Arjun answered Jul 15, 2015 Arjun comment Share Follow See all 2 Comments See all 2 2 Comments reply Purple commented Jan 27, 2017 reply Follow Share Is every countable language recursive enumerable? 0 votes 0 votes Nikhil Tank commented Oct 6, 2019 reply Follow Share Yes 0 votes 0 votes Please log in or register to add a comment.
