按年被提到
20142014 · 1 次2026
算法与数据结构›经典算法与数据结构·arXiv:1411.4798 · cs.ET

Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

Fabio L. Traversa, Chiara Ramella, Fabrizio Bonani, Massimiliano Di Ventra · 2014
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2014-11-24 · 最近 2017-12-27
2不同的人
2活跃月份
2讨论串
75被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proved mathematically that memcomputing machines have the same computational power of non-deterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using the appropriate architecture, with resources that only grow polynomially with the input size. The reason for this computational power stems from properties inspired by the brain and shared by any universal memcomputing machine, in particular intrinsic parallelism and information overhead, namely the capability of compressing information in the collective state of the memprocessor network. Here, 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. We have fabricated this architecture using standard microelectronic technology so that it can be easily realized in any laboratory setting. Even though the particular machine presented here is eventually limited by noise--and will thus require error-correcting codes to scale to an arbitrary number of memprocessors--it represents the first proof-of-concept of a machine capable of working with the collective state of interacting memory cells, unlike the present-day single-state machines built using the von Neumann architecture.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论whaaswijk · 2017-12

“It's worth noting that Scott Aaronson has commented on previous work by the same authors: https://www.scottaaronson.com/blog/?p=2212. At the time, he was convinced that their approach wouldn't scale. I'm not sure about their current approach, but at a glance it seems similar to the previous one. Previous work: https://arxiv.org/pdf/1411.4798.pdf”

Evidence of exponential speed-up in the solution of hard optimization problems?原评论 ↗
被提交为 story · 1 次