Related papers: Probabilistic Turing Machine and Landauer Limit

We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…

We develop a synthesis of Turing's paradigm of computation and von Neumann's quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing…

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…

We present a massive equilibrium simulation of the three-dimensional Ising spin glass at low temperatures. The Janus special-purpose computer has allowed us to equilibrate, using parallel tempering, L=32 lattices down to T=0.64 Tc. We…

In two recent papers, Maroney and Turgut separately and independently show generalisations of Landauer's erasure principle to indeterministic logical operations, as well as to logical states with variable energies and entropies. Here we…

We show that there is a class of stochastic baker's transformations that is equivalent to the class of equilibrium solutions of two-dimensional spin systems with finite interaction. The construction is such that the equilibrium distribution…

The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially,…

This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…

We develop two complementary generative mechanisms that explain when and why Benford's first-digit law arises. First, a probabilistic Turing machine (PTM) ensemble induces a geometric law for codelength. Maximizing its entropy under a…

In a recent paper [Phys. Lett. A {\bf335}, 351 (2005)] the authors discussed the equivalence among the various probability distribution functions of a system in equilibrium in the Tsallis entropy framework. In the present letter we extend…

Entropy is a central concept in physics, but can be challenging to calculate even for systems that are easily simulated. This is exacerbated out of equilibrium, where generally little is known about the distribution characterizing simulated…

We describe a method to axiomatize computations in deterministic Turing machines. When applied to computations in non-deterministic Turing machines, this method may produce contradictory (and therefore trivial) theories, considering…

Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite ($*$-finite) number of bits while keeping the finite…

We propose general conditions for the emergence of Turing patterns in a domain that changes size through homogeneous growth/shrinkage based on the qualitative changes of a potential function. For this part of the work, we consider the most…

The numerical simulation of two-dimensional quantum many-body systems away from equilibrium constitutes a major challenge for all known computational methods. We investigate the utility of Tree Tensor Network (TTN) states to solve the…

Infinite time Turing machines (ITTMs) have been introduced by Hamkins and Lewis in their seminal article arXiv:math/9808093. The strength of the model comes from a limit rule which allows the ITTM to compute through ordinal stages. 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…

Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.

After having developed a method that measures real time evolution of quantum systems at a finite temperature, we present here the simplest field theory where this scheme can be applied to, namely the 1+1 Ising model. We will compute the…

The Turing Machine has two implicit properties that depend on its underlying notion of computing: the format is fully determinate and computations are information preserving. Distributed representations lack these properties and cannot be…