|
|
|
|
|
|
by nabla9
2552 days ago
|
|
|
The original Church-Turing thesis says nothing about computational complexity. Extended Church-Turing thesis says that all Turing machine equivalent computers can compute the same problems withing polynomial time. Quantum computers are not known to be capable of solving NP-Complete problems in polynomial time. |
|
|