3 ms·
Of course "any algorithm" part can't be proved, because that is equivalent to proving P vs PSPACE. (PSPACE is as powerful as any quantum computer.) Just like ev
by sanxiyn 7y ago
Of course "any algorithm" part can't be proved, because that is equivalent to proving P vs PSPACE. (PSPACE is as powerful as any quantum computer.) Just like everything in computational complexity, proof is under "standard assumptions".