0

This problem is not decidable (reducible to halting problem) but is semi-decidable and therefor verifiable (as those two definitions are equivalent: How to prove semi-decidable = verifiable?).

However, is this problem poly-time verifiable?

A decision problem $P$ is poly time verifiable iff there is an algorithm called verifier such that if $P(w)=$ then there is a string $c$ s.t. $(w,c)=$, if $P(w)=$ then for all strings $c$, $(w,c)=$ and V runs in $O(w^{k})$ for some constant $k$ for all inputs $w$.

DeeDee
  • 345
  • 1
  • 9
  • 1
    Please [edit] your question to include a definition of the term "poly-time verifiable". The example does no appear to be a special case of the general question, because it is possible for a program $p$ to be in $P$ even if it is not an element of that enumeration. The reason has to do with the fact that two different programs can decide the same language, and "equivalent" (in terms of behavior) is not the same as equal (syntactically). – D.W. Jun 21 '20 at 21:50
  • @D.W. I know that this is a separate question, but can you verify a string is an element of the above enumeration of P (or can you do this for any other enumeration of P for that matter)? I'll edit the question accordingly thank you! Just curious since you pointed out that this is a different question. – DeeDee Jun 21 '20 at 21:56
  • @D.W. i ask the above question in the comments because an answer would greatly clarify why it is not an example and then i can remove it. It seems that we could efficiently decide whether a string fits the encoding in the example (is a member of the enumeration) in poly time, or at least that we could verify in poly time one of its members? – DeeDee Jun 21 '20 at 22:07
  • @D.W. okay, I removed it and asked it separately: https://cs.stackexchange.com/questions/127525/decide-if-a-string-is-a-member-of-a-language-that-represents-p Curious about these two, sorry. – DeeDee Jun 21 '20 at 22:26

1 Answers1

2

No. If the problem was polynomial-time verifiable, it would be solvable in exponential time, and thus decidable; but we already know that is not decidable.

Why in exponential time? Because $V$ runs in time $|w|^k$, it can read at most $|w|^k$ bits of the input. So, it suffices to enumerate all possible strings $c$ of length at most $|w|^k$, and run $V$ on each of them. The running time will be about $2^{|w|^k}$, which is finite and thus enough to make the original problem decidable.

D.W.
  • 159,275
  • 20
  • 227
  • 470