info@avatto.com
+91-9920808017
11. Bounded minimalization is a technique for
proving whether a promotive recursive function is turning computable or not
proving whether a primitive recursive function is a total function or not
generating primitive recursive functions
generating partial recursive functions
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
12. If there exists a language L, for which there exists a TM, T, that accepts every word in L and either rejects or loops for every word that is not in L, is called
recursive
recursively enumerable
NP-HARD
none of these
13. Which of the following statement(s) is/are correct?
L = {an bn an | n = 1, 2, 3...} is recursively enumerable
Recursive languages are closed under union
Every recursive is closed under union
All of these
14. Universal TM influenced the concept of
stored program computers
interpretative implementation of programming language
computability
all of these
15. Number of external states of a UTM should be atleast
1
2
3
4
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
