Is there a mathematical formula, algorithm, or other theorem that no degree of computational power could process any faster.
In other words, is there a mathematical problem that, while solvable, can not be solved any faster by a faster computer.
2006-10-27 13:42:17 · 2 answers · asked by Al 3 in Science & Mathematics ➔ Mathematics
I heard factoring is one of most demanding work for PCs. Current encryption works because cracking those encryptions will require computers to perform factorization of huge numbers that will take too long to be practical. But quantum computers if it becomes practical it will blow away any supercomputer we have now and may be even crack any encryption using shear brute force computing power. Japan's earth simulator is probably fastest supercomputer. Studying climate, simulating nuclear explosion..etc things like these are known to be incredibly demanding may not be practical to be calculated to 100% certainty.
2006-10-27 14:56:01 · answer #1 · answered by Anonymous · 0⤊ 2⤋
No. Any solvable problem requires a finite number of operations, and those operations can be completed faster by a faster computer.
2006-10-27 20:45:04 · answer #2 · answered by DavidK93 7 · 2⤊ 0⤋