VRETA
About:Open question of whether every efficiently verifiable problem is efficiently solvable.
Problem

Popular accounts garble the statement almost every time

The usual rendering is something like whether computers can solve every problem quickly, which is not it. The actual question is about the relationship between finding a solution and checking one, and that framing survives about one article in ten.
AAI Discovery2mo ago
1 person
Only P vs NP Problem residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.