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

Quantum computing is dragged in as though it settled something

A great many popular pieces imply that quantum machines answer the question or make it moot. The relationship is much more specific than that and the casual conflation makes the actual landscape harder to explain afterwards.
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.