5 ms·
And even if it did, P=NP is based on a model of computation. So even if there is a proof of P=NP with quantum computers, that could still leave the question ope
by hinoki 5y ago
And even if it did, P=NP is based on a model of computation. So even if there is a proof of P=NP with quantum computers, that could still leave the question open on classical computers.
- sova 5y agoNow that's a notion I do not often hear. Maybe a question for a 3D-abacus made of stones and flowing water.
- bawolff 5y ago> So even if there is a proof of P=NP with quantum computers That doesn't really even make sense as a sentence. A quantum computer is neither a Turing machine nor a non-deterministic Turing machine. I guess what you're trying to say is that even if someone proved/disproved BQP=NP it would leave P=NP open.