Memcomputing NP-complete problems in polynomial time | Dark Hacker News