### Prove that if a language L and its complement are recursively enumerable, then L and L’ are recursive.

Note that, we have already proved for 1)complement and union of recursive language is recursive. http://www.scitechtop.com/properties-of-recursive-and-recursively-enumerable-lanuguages/ we have L and L’ are recursively enumerable. so, […]