arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.08702cs.NEcs.ET
收藏

论记忆计算机的普遍性

On the Universality of Memcomputing Machines

Yan Ru Pei, Fabio L. Traversa, Massimiliano Di Ventra

摘要:

通用记忆计算机器(UMM)[IEEE Trans.Neural Netw.学习. 26,2702(2015)]表示一种新颖的计算模型,其中存储器(时间非局部性)完成信息的存储和处理的任务。UMM已经被证明是图灵完备的,即它们可以模拟任何图灵机。在本文中,我们使用集合论和基数参数,比较它们与液态机器(或“储备池计算“)和量子机器(“量子计算”)。我们表明,UMMs可以模拟这两种类型的机器,因此它们都是“液体”或“量子完全”和“量子完全”。当然,这些陈述只涉及这些机器可以解决的问题类型,而不是这些模拟所需的资源数量。尽管如此,这里提出的方法提供了一个通用框架,在其中描述UMM和任何其他类型的计算模型之间的关系。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑