Multiple choice question for engineering Set 1 1. The class of recursively ennumerable language is known as: a) Turing Class b) Recursive Languages c) Universal Languages d) RE AnswerAnswer: d [Reason:] RE or recursively ennumerable is only called the class of recursively ennumerable language. 2. A language L is said to be Turing decidable if:…
This content is for paid premium members only.
You can view complete answer after activation your membership.
Need only one answers. Simply buy single day pass and email. We will send answers for this question.
Login Buy membership