Related papers: Probabilistic Turing Machine and Landauer Limit
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
We show that a class of exactly solvable quantum Ising models, including the transverse-field Ising model and anisotropic XY model, can be characterized as the loops in a two-dimensional auxiliary space. The transverse-field Ising model…
Based on Landauer's principle, we provide a geometrical definition for the entropy of a given static, spherically symmetric spacetime. Considering a congruence of geodesics across a surface, one defines the entropy of a congruence as the…
Contrary to the actual nonlinear Glauber model (NLGM), the linear Glauber model (LGM) is exactly solvable, although the detailed balance condition is not generally satisfied. This motivates us to address the issue of writing the transition…
If we assume the Thesis that any classical Turing machine T, which halts on every n-ary sequence of natural numbers as input in a determinate time t(n), determines a PA-provable formula, whose standard interpretation is an n-ary…
We consider the limit set of generalised iterated function systems. Under the assumption of a natural potential, the so called cylinder function, we prove the existence of the invariant probability measure satisfying the equilibrium state.…
The concept of entropy in nonequilibrium macroscopic systems is investigated in the light of an extended equation of motion for the density matrix obtained in a previous study. It is found that a time-dependent information entropy can be…
In this work we consider a dynamic system consisting of a damped harmonic oscillator and we formalize a Turing Machine whose definition in terms of states, alphabet and transition rules, can be considered equivalent to that of the…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to…
A restricted form of Landauer's Principle, independent of computational considerations, is shown to hold for thermal systems by reference to the joint entropy associated with conjugate observables. It is shown that the source of the…
Despite their omnipresence in modern NLP, characterizing the computational power of transformer neural nets remains an interesting open question. We prove that transformers whose arithmetic precision is logarithmic in the number of input…
We propose a tensor-network algorithm for discrete-time stochastic dynamics of a homogeneous system in the thermodynamic limit. We map a $d$-dimensional nonequilibrium Markov process to a $(d+1)$-dimensional infinite tensor network by using…
I put forward a simple unidimensional mechanical analogue of the three-dimensional universe models of modern relativistic cosmology. The main goal of the proposal is the appropriate appreciation of the intrinsic relationship between…
Quantum many-body states that frequently appear in physics often obey an entropy scaling law, meaning that an entanglement entropy of a subsystem can be expressed as a sum of terms that scale linearly with its volume and area, plus a…
In this paper we study generalised Ising Glauber models with inflow of informa- tion in one dimension and derive expressions for the exit probability using well established analytical methods. The analytical expressions agree very well with…
It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is achieved via direct simulation of a Turing machine. Unlike previously informally…
In this paper we show that in systems where the probability distribution of the the overlap is non trivial in the infinity volume limit, the property of ultrametricity can be proved in general starting from two very simple and natural…
We consider a matching problem for time series with values in an arbitrary metric space, with the stretching penalty given by the Hellinger kernel. To optimize this matching, we introduce the Elastic Time Warping algorithm with a cubic…
In this series of works, we study exactly solvable non-unitary time evolutions in one-dimensional quantum critical systems ranging from quantum quenches to time-dependent drivings. In this part I, we are motivated by the recent works of…