This paper on memcomputing seems like a really big deal, but it doesn't seem to be particularly popular.  They prove that their UMM can solve NP problems in P, although they don't claim P = NP.  In their next paper, they go on to build a physical model of this UMM with moderate success. Does this mean P=NP?
Universal memcomputing machines (UMM)
complexity theory;computability;turing machines;computer architecture