"Comp" sci is so amazing

Yeah.. I can sit here in my apartment, at noob with a piece of paper and pen

and work on the hardest comp sci problem.. just relaxing.. no computer needed, no proofs needed, no textbooks.. just a mind

>>24
It's currently unknown whether or not a quantum computer is equivalent to a non-deterministic Turing machine, but most of those doing the research think that it is not. Instead, there's another complexity class (BQP) for problems with a quantum solution in (bounded) polynomial time. BQP is thought to encompass *some* NP problems as well as a few outside-NP problems, though nothing has been proven yet.