The Gateway to Computer Science Excellence
0 votes

Show that the following problems are not recursively enumerable:

  1. The set of pairs $(M,w)$ such that $TM \ M$, started with input $w$, does not halt.
  2. The set of pairs $(M_{1},M_{2})$ such that $L(M_{1}\cap L_(M_{2})=\phi$.
  3. The set of triples $(M_{1},M_{2},M_{3})$ such that $L(M_{1}) = L(M_{2})L(M_{3})$ ; i.e., the language of the first is the concatenation of the languages of the two $TM's$. 
in Theory of Computation by Veteran (55k points)
edited by | 12 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,645 questions
56,601 answers
102,212 users