1.

Which of the following is incorrect according to rice theorem?
Let S be a set of language hat is non trivial:

A. there exists a TM that recognizes the language in S
B. there exists a TM that recognizes the language not in S
C. it is undecidable to determine whether the language recognized by an arbitrary turing machine lies in S
D. all of the mentioned
Answer» E.


Discussion

No Comment Found