Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines · HackerPapers discussions

Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines — mentioned by Animats

Wed, 27 Dec 2017 22:59:10 GMT

Right. See the PDF of the paper at [1]. They're mapping Boolean logic into a kind of analog system. "SOLGs can use any terminal simultaneously as input or output, i.e., signals can go in and out at the same time at any terminal resulting in a superposition of input and output signals ... The gate changes dynamically the outgoing components of the signals depending on the incoming components according to some rules aimed at satisfying the logic relations of the gate. ... A SOLG ... can have either stable configurations ... or unstable ... configurations. In the former case, the configuration…

Paper and discussion history. A mention is not an endorsement.

Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines — mentioned by marmaduke

Wed, 27 Dec 2017 22:03:19 GMT

Did you look at the paper or just throwing the analogy out there? It seems the described problems are integer programming which wouldn’t have gradients as in back propagation. The magic seems to lie in the so called self organizing logic gates detailed https://arxiv.org/abs/1512.05064

Paper and discussion history. A mention is not an endorsement.

Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines — HN submission

Sun, 10 Jan 2016 18:53:57 GMT

Polynomial-Time Solution to an NP-Hard Problem with Digital Memcomputing Machine

4 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines — HN submission

Fri, 18 Dec 2015 15:05:28 GMT

Digital Memcomputing Machines: Strong Evidence That P=NP

2 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.