通用内存计算机
Universal Memcomputing Machines
摘要:
我们引入了通用记忆计算机器(UMMs)的概念:一类基于具有记忆的系统的受大脑启发的通用计算机器,其中信息的处理和存储发生在同一物理位置。我们分析证明,UMM的内存属性赋予他们通用的计算能力-他们是图灵完备-,内在的并行性,功能多态性,和信息开销,即他们的集体状态可以支持指数数据压缩直接在内存中。我们还证明了一个UMM具有相同的计算能力作为一个非确定性图灵机,即它可以解决NP-完全问题在多项式时间。然而,由于其信息开销,UMM仅需要随着问题大小多项式增长的存储单元(存储处理器)的量。作为一个例子,我们提供的子集和问题的多项式时间的解决方案和一个简单的硬件实现。尽管这些结果并不能证明图灵范式中的NP=P,但这些UMM的实际实现将代表从目前的冯·诺依曼架构的范式转变,使我们更接近于类脑神经计算。
英文摘要:
We introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location. We analytically prove that the memory properties of UMMs endow them with universal computing power - they are Turing-complete -, intrinsic parallelism, functional polymorphism, and information overhead, namely their collective states can support exponential data compression directly in memory. We also demonstrate that a UMM has the same computational power as a non-deterministic Turing machine, namely it can solve NP--complete problems in polynomial time. However, by virtue of its information overhead, a UMM needs only an amount of memory cells (memprocessors) that grows polynomially with the problem size. As an example we provide the polynomial-time solution of the subset-sum problem and a simple hardware implementation of the same. Even though these results do not prove the statement NP=P within the Turing paradigm, the practical realization of these UMMs would represent a paradigm shift from present von Neumann architectures bringing us closer to brain-like neural computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。