“A [reversible computer][1] 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.

  [1]: https://en.m.wikipedia.org/wiki/Reversible_computing