# Tag Info

Proving P=NP in the same time shows that such algorithm gives a proof to NP in polynomial time if it's true, assuming a same program appears for infinite times: (assuming $n>1$) for k=1..inf x=[result running the k-th program for n^k steps] if x is a proof then return x