The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes

I have a doubt in the proof of  membership problem that is MP = {M # x |  M accepts x }....

here sir is telling that TM N is just a copy cat of TM M....only change is ..reject state of TM M is  connected to accept state of TM if TM M accepts or rejects x then TM N halts on x....i have understood  this...

My doubt is.....sir is telling that if TM M does not halt on x then TM N rejects x.......but I am not getting how is it possible....because if TM M is looping on x then how TM N can rejects x....also I think that since TM N is some what same like TM M ..then if TM M loops on x then TM N should loops on x....please anyone clarify my doubt....

Thanks in advance.. 

asked in Theory of Computation by (149 points)
edited by | 12 views
Please anyone answer this....

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
47,913 questions
52,293 answers
67,736 users