|
|
|
|
|
by murbard2
3960 days ago
|
|
The statement is also a common fallacy that Scott Aaronson has addressed many times. While some exponential speedups are possible, there are no indications that they are possible in general for problems in NP, and even if they were, we know that they would have to use the structure of the problem and not merrely "consider possibilities simulatenously" |
|