Kripke's distinction between epistemic and metaphysical possibility implies that P = NP being mathematically true does not collapse the epistemic gap between search and verification.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.
The hypothesis that for all problems in NP, the difficulty of deciding membership and verifying membership coincide up to a polynomial factor
Search and verification(in computer science and the P vs NP problem)
Search means trying to find a solution to a problem; verification means checking whether a proposed solution is correct. The gap refers to how much harder it might be to find answers compared to checking them.
metaphysical possibility(Distinguished from mathematical possibility to argue that some mathematically consistent results are ruled out by the nature of concrete reality)
What is possible in the concrete world, which is a more restrictive domain than mathematical possibility