The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+24 votes
1.7k views

Consider the following problem X.

Given a Turing machine M over the input alphabet $\Sigma$, any state q of M and a word $w \in \Sigma^*$, does the computation of M on w visit the state of q?

Which of the following statements about X is correct?

  1. X is decidable
  2. X is undecidable but partially decidable
  3. X is undecidable and not even  partially decidable
  4. X is not a decision problem
asked in Theory of Computation by Veteran (68.9k points)
edited by | 1.7k views

1 Answer

+37 votes
Best answer

X is undecidable but partially decidable.

We have the TM M. Just make the state q the final state and make all other final states non-final and get a new TM M'. Give input w to M'. If w would have taken M to state q (yes case of the problem), our new TM M' would accept it. So, the given problem is partially decidable.

If M goes for an infinite loop and never reaches state q (no case for the problem), M' cannot output anything. This problem is the state entry problem, which like word accepting problem and halting problem is undecidable.

 

answered by Veteran (332k points)
selected by
Yeah..  But what if the state isn't a final state...? Shouldn't we think of that case too? I understand that this reduces to halting problem when the state q is final.. What if it isn't?
state q in M need not be final state. It is just that in our new machine M' we make q final and all other nonfinal.

M' works the same way as M (same rules) but in M' if it ever goes to q then we get an answer YES.
Can we use the rices theorem on this ? anyone please explain....

No, you can't use rice theorem here as rice theorem is applicable on the properties of languages. Here in the question this is not a property of a language.

http://gatecse.in/rices-theorem/

Refer to this link.

 Also, if the property of TM is given then try to reduce it into the property of some language if you can do that then you can apply Rice theorem. But it is not possible in every case.

 

what is the difference between undecidable and partially decidable problems?
@arjun sir ,   what can we say about '' no case of the problem '' in which original M does not enters the state "q",  and halts and rejects the w on some other state   I think in  that case new machine  M' will also haltSand reject w ... then what we say about its decidability   ??
@sir can we say that if the above question was decidable then halting problem would be decidable?

I mean to say that we can reduce Halting problem to above problem(so called state entry problem).

Right?
.halting problem of turing machine is undecidable but partially deciadble hence this problem can be redu ced from halting problem so is undecidable put partially decidable

@Venkat Sai Yes Sir, you're right. My Bad. Thank you!

@larnav u can design a universal turing machine which accepts a turing machine and a string input and say yes if it halts because it can wait till it halts and say yes if it reaches final state but if it doesn't halt or goes into an infinite loop the universal turing machine cannot say no so we can say yes or go into infinite loop or wait forever hence it is semi decidable and undecidable as every semi decidable is also undecidable
@Arjun sir. I think we also need to set all transitions of state q back to q in the new TM. Because it might be possible that the TM visits state q, but moves on and stops at any other state. This will give a NO answer. But the answer of our original question is YES. right??

@Arjun sir ..is my reasoning correct?

i can reduce the halting prblm into the given GATE _2001 problem.. let the state q=final state..

$\Rightarrow$give any word w on machine $M$

$\Rightarrow$do machine visit this state?

YES         

     $\Rightarrow$Word will halt in final state and hence will be accepted .

NO         

     $\Rightarrow$if the word does not visit q that means this word will not be accepted by machine M .


Hecne i have reduced

$\text{HALTING PROBLEM <p Gate 2001 problem}$

.as we know Halting problem is Harder  so is GATE 2001 prblm.

as we know Halting problem is semidecidable   so is GATE 2001 prblm.



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

32,693 questions
39,293 answers
110,109 comments
36,701 users