Related papers: Programming infinite machines
New status in quantum mechanics is connected with recent achievements in the inverse problem. With its help instead of about ten exactly solvable models which serve as a basis of the contemporary education there are infinite (!) number,…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
We investigate a variant of the fuel-based approach to modeling diverging computation in type theories and use it to abstractly capture the essence of oracle Turing machines. The resulting objects we call continuous machines. We prove that…
There exists a huge number of numerical methods that iteratively construct approximations to the solution $y(x)$ of an ordinary differential equation (ODE) $y'(x)=f(x,y)$ starting from an initial value $y_0=y(x_0)$ and using a finite…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so; it…
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
The theory of point-particles in classical electrodynamics has a well-known problem of infinite self-energy, and the same is true of quantum electrodynamics. Instead of concluding that there is no such thing as a true point-particle, it is…
We consider infinite dimensional port-Hamiltonian systems. Based on a power balance relation we introduce the port-Hamiltonian system representation where we pay attention to two different scenarios, namely the non-differential operator…
This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a…
The issue of the "eternal return" is examined from the perspective of the topology of spacetime. Constraints on dynamical laws for the periodic evolution of a system or universe are highlighted. Using a Fourier series expansion, an infinite…
Dantzig and Eaves claimed that fundamental duality theorems of linear programming were a trivial consequence of Fourier elimination. Another property of Fourier elimination is considered here, regarding the existence of implicit equalities…
Determining whether a program terminates is a core challenge in program analysis with direct implications for correctness, verification, and security. We investigate whether transformer architectures can recognise termination patterns…
The interplay between supersymmetry and classical and quantum computation is discussed. First, it is shown that the problem of computing the Witten index of $\mathcal N \leq 2$ quantum mechanical systems is $\#P$-complete and therefore…
Invariant manifolds provide the geometric structures for describing and understanding dynamics of nonlinear systems. The theory of invariant manifolds for both finite and infinite dimensional autonomous deterministic systems, and for…
It is shown that the phenomenon of irreversibility in many-body and few-body systems can be explained and described within the framework of the concept of direct (not instantaneous) interaction of particles without using probabilistic…
Current theories of massless free particle assume {\sl unitary} space inversion and {\sl anti-unitary} time reversal operators. In so doing robust classes of possible theories are discarded. In the present work theories of massless systems…
Using a new Bayesian method for solving inverse quantum problems, potentials of quantum systems are reconstructed from coordinate measurements in non-stationary states. The approach is based on two basic inputs: 1. a likelihood model,…
Manin, Feynman, and Deutsch have viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum logic circuits and quantum Turing machines has shown how these machines can simulate an…
Following previous investigations by {\"U}st{\"u}nel [22] about the invertibility of some transformations on the Wiener space, we find some entropic conditions under which a random change of time is invertible on the Poisson space. As a…