Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

Consider a language L for which there exists a Turing machine (TM), T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is

Choose the correct answer:

A) NP hard

B) NP complete

C) recursive

D) recursively enumerable

Detailed Explanation

No Explanation

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback