English
Related papers

Related papers: On the Universality of Memcomputing Machines

200 papers

We show that transformer-based large language models are computationally universal when augmented with an external memory. Any deterministic language model that conditions on strings of bounded length is equivalent to a finite automaton,…

Computation and Language · Computer Science 2023-01-12 Dale Schuurmans

Turing Machines are universal computing machines in theory. It has been a long debate whether Turing Machines can simulate the consciousness mind behaviors in the materialistic universe. Three different hypotheses come out of such debate,…

Neurons and Cognition · Quantitative Biology 2018-01-01 Hongbo Jia

The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…

Quantum Physics · Physics 2020-04-21 Francesco Tacchino , Alessandro Chiesa , Stefano Carretta , Dario Gerace

Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…

The model of local Turing machines is introduced, including classical and quantum ones, in the framework of matrix-product states. The locality refers to the fact that at any instance of the computation the heads of a Turing machine have…

Quantum Physics · Physics 2020-03-31 Dong-Sheng Wang

Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of `standard' Quantum Computers. These approaches rely on and indicate that Quantum…

Quantum Physics · Physics 2010-05-10 Martin Ziegler

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

Computational Complexity · Computer Science 2010-12-20 Hector Zenil

Recently, among experiments for realization of quantum computers, NMR quantum computers have achieved the most impressive succession. There is a model of the NMR quantum computation,namely Atsumi and Nishino's bulk quantum Turing Machine.…

Computational Complexity · Computer Science 2007-05-23 Tetsushi Matsui

Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used…

Formal Languages and Automata Theory · Computer Science 2013-09-06 Kenichi Morita

Recurrent neural networks (RNNs) and transformers have been shown to be Turing-complete, but this result assumes infinite precision in their hidden representations, positional encodings for transformers, and unbounded computation time in…

Computational Complexity · Computer Science 2023-09-27 Ankur Mali , Alexander Ororbia , Daniel Kifer , Lee Giles

The Universal Turing Machine (TM) is a model for VonNeumann computers --- general-purpose computers. A human brain can inside-skull-automatically learn a universal TM so that he acts as a general-purpose computer and writes a computer…

Artificial Intelligence · Computer Science 2019-03-28 Juyang Weng

We show theoretically that networks of membrane memcapacitive systems -- capacitors with memory made out of membrane materials -- can be used to perform a complete set of logic gates in a massively parallel way by simply changing the…

Emerging Technologies · Computer Science 2015-07-09 Yuriy V. Pershin , Fabio L. Traversa , Massimiliano Di Ventra

Neural Turing Machines (NTMs) are an instance of Memory Augmented Neural Networks, a new class of recurrent neural networks which decouple computation from memory by introducing an external memory unit. NTMs have demonstrated superior…

Machine Learning · Computer Science 2018-08-21 Mark Collier , Joeran Beel

We outline the construction of a molecular system that could, in principle, implement a thermodynamically reversible Universal Turing Machine (UTM). By proposing a concrete-albeit idealised-design and operational protocol, we reveal…

Statistical Mechanics · Physics 2021-02-09 Rory A. Brittain , Nick S. Jones , Thomas E. Ouldridge

The universality of a quantum neural network refers to its ability to approximate arbitrary functions and is a theoretical guarantee for its effectiveness. A non-universal neural network could fail in completing the machine learning task.…

Quantum Physics · Physics 2023-06-27 Xiaokai Hou , Guanyu Zhou , Qingyu Li , Shan Jin , Xiaoting Wang

Quantum reservoir computing uses the dynamics of quantum systems to process temporal data, making it particularly well-suited for machine learning with noisy intermediate-scale quantum devices. Recent developments have introduced…

Quantum Physics · Physics 2026-02-25 Lukas Gonon , Rodrigo Martínez-Peña , Juan-Pablo Ortega

Quantum computing exploits fundamentally new models of computation based on quantum mechanical properties instead of classical physics, and it is believed that quantum computers are able to dramatically improve computational power for…

Quantum machine learning may permit to realize more efficient machine learning calculations with near-term quantum devices. Among the diverse quantum machine learning paradigms which are currently being considered, quantum memristors are…

Quantum Physics · Physics 2024-12-30 Lucas Lamata

Neural networks powered with external memory simulate computer behaviors. These models, which use the memory to store data for a neural controller, can learn algorithms and other complex tasks. In this paper, we introduce a new memory to…

Neural and Evolutionary Computing · Computer Science 2019-12-30 Hung Le , Truyen Tran , Svetha Venkatesh

We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazirani who have shown that…

Quantum Physics · Physics 2016-11-18 Markus Mueller