Which of the following is incorrect according to rice theorem?
Posted: Thu Jul 14, 2022 9:26 am
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
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