Universal Memcomputing Machines · HackerPapers discussions

Universal Memcomputing Machines — mentioned by cbennett

Mon, 24 Nov 2014 20:02:32 GMT

"Also they are not ambitious enough. Assuming constant time arithmetic of the real numbers should get you more (like maybe even the halting problem)." Agreed. They do at least broach the idea though, this is from the companion paper (more theoretical): "We have thus shown that a UMM is Turing-complete, namely it can simulate any Turing machine (whether deterministic or not). Note, however, that the reverse is not necessarily true. Namely, we have not demonstrated that a UTM can simulate a UMM, or, equivalently, we have not demonstrated that a UMM is Turing-equivalent. It is worth pointing out…

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

Universal Memcomputing Machines — mentioned by TTPrograms

Mon, 24 Nov 2014 18:54:54 GMT

The ability to solve NP-complete problems seems to be dependent on the concept of information overhead. It's explained a bit in the theory paper here: http://arxiv.org/pdf/1405.0931.pdf One concern I have is in section VI-A. The author refers to the ability to read out of a collection of memory elements the sum of their contents. Since the sums are totally defined by the other numbers it doesn't seem that you can count those bits as additional information. Maybe I'm missing something, though. The bit after on Exponential Information Overhead seems more robust.

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