3 ms·
If time is not a constraining factor, then none (Turing-completeness). Applications requiring much parallelism, like NP-complete problems, may be more amenable
by nearestneighbor 17y ago
If time is not a constraining factor, then none (Turing-completeness).
Applications requiring much parallelism, like NP-complete problems, may be more amenable to being solved by quantum computers in the future.