Skip to main content
1 of 1
Craig Feinstein
  • 2.6k
  • 4
  • 26
  • 36

“A reversible computer can factor integers efficiently in polynomial-time”: Since a reversible computer can multiply two integers efficiently in polynomial-time, it can also factor an integer efficiently in polynomial-time by just putting the computer in reverse.

I wish this were true.

Craig Feinstein
  • 2.6k
  • 4
  • 26
  • 36