384 views
1 votes
1 votes

Use Rice’s theorem, to prove the undecidability of each of the following languages.

  1. $INFINITE_{TM} = \{\langle M \rangle \mid \text{M is a TM and L(M) is an infinite language}\}$.
  2. $\{\langle M \rangle \mid  \text{M is a TM and }\:1011 \in L(M)\}$.
  3. $ ALL_{TM} = \{\langle M \rangle \mid \text{ M is a TM and}\: L(M) = Σ^{\ast} \}$.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
3
admin asked Oct 20, 2019
694 views
Let $X = \{\langle M, w \rangle \mid \text{M is a single-tape TM that never modifies the portion of the tape that contains the input $w$ } \}$Is $X$ decidable? Prove you...