Reputation
Next privilege 125 Rep.
Vote down
Badges
2
Newest
 Supporter
Impact
0 people reached

  • 0 posts edited
  • 0 helpful flags
  • 9 votes cast
Jan
31
comment Can an irrational number raised to an irrational power be rational?
Ba-dum-chhhh. Short and sweet.
Jan
30
comment Why is integer factorization considered to be in NP if a quantum computer can compute a factorization in polynomial time?
I always understood that any problem in BQP was at the very least in EXP, just by computing out the (exponentially large) state descriptions. Further, I figured that "Turing" here refers to "Turing-complete," that is, simulatable by a Turing machine, and capable of simulating a Turing machine. How, then do quantum computers fail to be "Turing"?
Jan
30
awarded  Supporter
Jan
30
awarded  Autobiographer