Question 2052 – Nielit Scientific Assistance CS 15-10-2017
November 9, 2023Question 2056 – Nielit Scientific Assistance CS 15-10-2017
November 9, 2023Question 2053 – Nielit Scientific Assistance CS 15-10-2017
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 said to be
Correct Answer: B
Question 7 Explanation:
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 said to be recursively enumerable
recursive
recursively enumerable
NP-Hard
None of the above