按年被提到
20172019 · 2 次2026
物理与量子›计算的物理极限·arXiv:1712.08702 · cs.NE

On the Universality of Memcomputing Machines

Yan Ru Pei, Fabio L. Traversa, Massimiliano Di Ventra · 2017
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2019-05-14 · 最近 2019-10-17
2不同的人
2活跃月份
2讨论串
27被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs have been shown to be Turing-complete, namely they can simulate any Turing machine. In this paper, using set theory and cardinality arguments, we compare them with liquid-state machines (or "reservoir computing") and quantum machines ("quantum computing"). We show that UMMs can simulate both types of machines, hence they are both "liquid-" or "reservoir-complete" and "quantum-complete". Of course, these statements pertain only to the type of problems these machines can solve, and not to the amount of resources required for such simulations. Nonetheless, the method presented here provides a general framework in which to describe the relation between UMMs and any other type of computational model.

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

HN 书评

没有评论直接链到它;下面是它被提交的讨论串里回复最多的评论(不计入统计)

讨论串里没有 ≥100 字的评论,只有提交记录。

被提交为 story · 2 次