17 Dec
2003
17 Dec
'03
11:17 p.m.
Ray Cromwell writes
And regardless of whether quantum computers work or not, they are still algorithmic if they can be simulated (however slowly) by a turing machine. It's a rigorous mathematical definition.
This is flagrantly false. A frog can be simulated, give infinite time and infinite tape size, but a frog is not an algorithm.