The Gateway to Computer Science Excellence
+1 vote

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} \}$.
in Theory of Computation by Veteran (59.3k points) | 25 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,382 answers
105,323 users