Which of the following statements is true?
A. f is computable if and only if Lf is recursive.
B. f is computable if and only if Lf is recursively enumerable.
C. if f is computable then Lf is recursive, but not conversely.
D. if f is computable then Lf is recursively enumerable, but not conversely.
Answer:A
Which of the following statements is true?
A. f is computable if and only if Lf is recursive. B. f is computable if and only if Lf is recursively enumerable. C. if f is computable then Lf is recursive, but not conversely. D. if f is computable then Lf is recursively enumerable, but not conversely.