This question might sound stupid but, can the language of a TM be not recursively enumerable ?
Thank you ~
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community
No, because A TM has 3 possibilities: run forever, accept, or reject. So the language of a TM is recursively enumerable as the TM M either accepts some input x, which means x is in L(M), or otherwise rejects or runs forever.
A language can be non-recursively enumerable, but the language of a concrete TM is always recursively enumerable.