Question

What is recursive and recursively enumerable language?

Answer 1

a language is recursive if there exists a Turing machineor other computable function that accepts every string of the language and rejects every string (over the same alphabet) that is not in the language. ... Clearly, every recursive language is also recursively enumerable