#### I slipped on muh snake oil

*"We show an experimental demonstration of an actual memcomputing architecture that solves the NP-complete version of the subset sum problem in only one step and is composed of a number of memprocessors that scales linearly with the size of the problem”*

In other words: magic.

100 units of the currently strongest currency that this computational version of a perpetual motion machine is not going to hold up for long. Some resource is sure to increase exponentially or demand exponential precision somewhere.

Haven't thought about it yet, but lady nature doesn't like her no-go areas lifted, that's pretty certain.

The claim also seems to be that you can build an implementation of a quantum computer (which appears to NOT be able to solve problems in NP in polynomial time, see the problem class BQP) using classical microelectronics. Nein, nein,. nein.