Related papers: The model of the ideal rotary element of Morita
In this position paper, we present a discussion on neuromorphic computing and especially the learning/training algorithm to design a series of brains with different memristive values to solve complex ill-posed inverse problems based on a…
In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for…
A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
Reversible computing models settings in which all processes can be reversed. Applications include low-power computing, quantum computing, and robotics. It is unclear how to represent side-effects in this setting, because conventional…
This work examines approaches to making computational models reversible. Broadly speaking, transforming a computational model into a reversible one, i.e. reversibilizing it, means extending its operational semantics conservatively in a way…
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
High-level reversible programming languages are few and far between and in general offer only rudimentary abstractions from the details of the underlying machine. Modern programming languages offer a wide array of language constructs and…
The issue of irreversibility in a universe with time-reversal-symmetric laws is a central problem in physics. % , and, in particular, to statistical mechanics, information theory and quantum thermodynamics. In this letter, we discuss for…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
Ising machines are a form of quantum-inspired processing-in-memory computer which has shown great promise for overcoming the limitations of traditional computing paradigms while operating at a fraction of the energy use. The process of…
Reversible logic has two main properties. First, the number of inputs is equal to the number of outputs. Second, it implements a one-to-one mapping; i.e., one can reconstruct the inputs from the outputs. These properties enable its…
The advent of computational statistical disciplines, such as machine learning, is leading to a paradigm shift in the way we conceive the design of new compounds. Today computational science does not only provide a sound understanding of…
Recent investigations into the physical nature of information and fundamental limits to information transmission have revealed questions such as the possibility of superluminal data transfer or not; and whether reversible computation…
Reversible logic is gaining interest of many researchers due to its low power dissipating characteristic. In this paper we proposed a new approach for designing online testable reversible circuits. The resultant testable reversible circuit…
Since reversible computing requires preservation of all information throughout the entire computational process, this implies that all errors that appear as a result of the interaction of the information-carrying system with uncontrolled…
In a previous paper, we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…