How do we know that the P versus NP problem is an NP problem itself?

Determining for any statement if there is a proof with $n$ symbols or less is an $NP$ problem (i.e. the proof can be checked in polynomial time with respect to the length of the proof and the statement), that's probably the sense in which they meant that "P versus NP is itself NP". However, it does not really make sense to assign a complexity class to proving any particular statement (such as $P\neq NP$), as that technically takes constant time.


The "P versus NP" problem is a single yes-no question: is $NP = P$? The correct answer is either "yes" or "no", we just don't know which. But the complexity of the answer is $1$.

Tags:

Turing Machines

Computer Science

Computational Complexity

Related

How to show $\frac{d}{d x}\left(|x|^{1/2}\right)=\frac{x}{2|x|^{3/2}}$? Value of $\alpha$ for which $x^5+5\lambda x^4-x^3+(\lambda\alpha-4)x^2-(8\lambda+3)x+\lambda\alpha-2=0$ has roots independent of $\lambda$ Consider $\dot{x}=4x^{2}-16$. Unable to prove an exercise in Continuous functions in Topology Does the alternating composition of sines and cosines converge to a constant? One missing step in proving $\mathbb{Z}\times \mathbb{Z} \cong \langle a,b\,|\, [a,b]=1\rangle$ Embedding of countable linear orders into $\Bbb Q$ as topological spaces Is there a name for a group-like structure under a unary operation? Evaluate $\int_0^1 \ln{\left(\Gamma(x)\right)}\cos^2{(\pi x)} \; {\mathrm{d}x}$ How to show $\int_0^\infty\frac1{(1+x^2)(1+x^p)}$ doesn't depend on $p$? Olympiad question: In the regular pentagon $ABCDE$, the perpendicular at $C$ to $CD$ meets $AB$ at $F$. Prove that $AE + AF = BE$. How to evaluate $\int_{0}^{1} \! \frac{-\ln(1-t)}{t} \, \mathrm{d}t$ without using taylor series expansion?

Recent Posts