2,131 views
17 votes
17 votes
What is Partial Decidability ?  How do we check whether a problem is Partialy Decidable or Not ?

1 Answer

Best answer
21 votes
21 votes

Actually the problem mentioned there is known as state entry problem and is a standard RE but not REC or u can say semidecidable or partially decidable problem..I m listing below a few problems which u should know which are semidecidable problems..

A) Halting Problem :

Given a Turing Machine and an input string whether it will halt on that string or not..

B) Blank Tape Halting Problem :

The blank tape problem takes a machine and an empty tape and tells if this machine halts or not..

C) State Entry Problem :

 The problem is to determine whether Turing machine TM  , when given input w, ever enters state q.

D) Post Correspondence Problem :

https://en.wikipedia.org/wiki/Post_correspondence_problem

E) Modified Post Correspondence Problem :

http://www.iith.ac.in/~subruk/4510/pcp.pdf

The problems D) and E) however become decidable(recursive) if we consider unary alphabet..

selected by

Related questions

2 votes
2 votes
2 answers
1
shikharV asked Nov 14, 2015
2,220 views
I want to know how to remember which language is decidable for which property. Should I go through the proofs or should I remember everything?