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
Which of the following is incorrect according to rice theorem?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following is incorrect according to rice theorem?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!