Which of the following are correct statements?a) TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (

TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (a) and (

TMs that are guaranteed to halt only on acceptance are recursive ennumerable.

Which of the following are correct statements?a) TMs that always halt

1.	Which of the following are correct statements?a) TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (
A.	TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (a) and (
B.	TMs that are guaranteed to halt only on acceptance are recursive ennumerable.
C.	Both (a) and (b)
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion

No Comment Found

Related MCQs

With reference to binary strings, state true or false:Statement: For any turing machine, the input alphabet is restricted to {0,1}.
Which of the following is true for The Halting problem?a) It is recursively ennumerableb) It is undecidablec) Both (
Statement: If L id R.E., Lc needs to be R.E. Is it correct?
Which of the following are correct statements?a) TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (
Which of the following are decidable problems?a) Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}
Which of the following are incorrect options?a) Informally, problem is a yes/no question about an infinite set of possible instancesb) Formally, a problem is a languagec) Both (
Which of the following are undecidable problems?a) Determining whether two grammars generate the same languageb) Determining whether a grammar is ambiguousc) Both (
Diagonalization can be useful in:a) To find a non recursively ennumerable languageb) To prove undecidablility of haltig problemc) Both (
Which of the following technique is used to find whether a natural language isnt recursive ennumerable?a) Diagonalizationb) Recursive Inductionc) Both (
STATEMENT:_IF_L_ID_R.E.,_LC_NEEDS_TO_BE_R.E._IS_IT_CORRECT??$

Which of the following are correct statements?a) TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (

Discussion

No Comment Found

Related MCQs

Reply to Comment