Question

Prove that every recursive language is recursively enumerable

Answer 1

Answer:

Explanation:

A language is recursively enumerable if there exists a Turing machine that accepts every string of the language, and does not accept strings that are not in the language. (Strings that are not in the language may be rejected or may cause the Turing machine to go into an infinite loop.)

Answer 2

Explanation:

heya mate option A is the answer