Suppose we find out that P = NP with a constructive proof that also provides an efficient algorithm. Could we use this to settle other computational complexity problems, such as P vs PSPACE? I recently discovered that time-bounded Kolmogorov complexity is NP-hard, which is related to code optimization. So, could we build a heuristic algorithm to find algorithms for given problems if an efficient solution exists?
Yes.
>>16566273And?
>>16566128>Suppose we find out that P = NPI will suppose no such silly things ...
Bump