info@avatto.com
+91-9920808017
0. Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B*. We say f is computable if there exists a Turning machine M which given an input x in A*, always halts with f(x) on its tape. Let Lf denote the language {x ≠ f(x) | x ∈ A*}. Which of the following statements is true:
f if computable if and only if Lf is recursive.
f is computable if and only Lf recursively enumerable.
If f is computable then Lf is recursive, but not conversely.
If f is computable then Lf is recursively enumerable, but not conversely.
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
