Related papers: Programming infinite machines
There are good reasons to believe that we are classical algorithms run on (effectively) classical machines. However, the fact that a physical state of a system in a universe described by a classical deterministic model doesn't contain any…
This paper outlines a mathematical framework of quantum probability in which the time asymmetry in describing measuring processes is avoided. The main objects of the framework are hyperfinite operations, which are constructed by using…
Factorization of the incompressible Stokes operator linking pressure and velocity is revisited. The main purpose is to use the inverse of the Stokes operator with a large time step as a preconditioner for Newton and Arnoldi iterations…
By rewriting the Navier-Stokes equation in terms of differential forms we give a formulation which is abstracted and reproduced in a finite dimensional setting. We give two examples of these finite models and, in the latter case, prove some…
We consider the simplest nontrivial supersymmetric quantum mechanical system involving higher derivatives. We unravel the existence of additional bosonic and fermionic integrals of motion forming a nontrivial algebra. This allows one to…
We show that certain infinitesimal operators of the Lie-point symmetries of the incompressible 3D Navier-Stokes equations give rise to vortex solutions with different characteristics. This approach allows an algebraic classification of…
After a brief survey of the definition and the properties of Lambda-symmetries in the general context of dynamical systems, the notion of "Lambda-constant of motion'' for Hamiltonian equations is introduced. If the Hamiltonian problem is…
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invented or discovered, i.e., is empirical or is a priori. Second,…
We put forth the idea that Hamilton's equations coincide with deterministic and reversible evolution. We explore the idea from five different perspectives (mathematics, measurements, thermodynamics, information theory and state mapping) and…
In this paper, we study classes of structures and individual structures for which programs implementing functions defined everywhere are equivalent to finite tree-programs. The programs under consideration may have cycles and at most…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
Challenging the standard notion of totality in computable functions, one has that, given any sufficiently expressive formal axiomatic system, there are total functions that, although computable and "intuitively" understood as being total,…
Recently, a geometric embedding of the classical space and classical phase space of an n-particle system into the space of states of the system was constructed and shown to be physically meaningful. Namely, the Newtonian dynamics of the…
The goal of inductive program synthesis is for a machine to automatically generate a program from user-supplied examples. A key underlying assumption is that humans can provide sufficient examples to teach a concept to a machine. To…
The Buridan's ass paradox is characterized by perpetual indecision between two states, which are never attained. When this problem is formulated as a dynamical system, indecision is modeled by a discrete-state Markov process determined by…
Current probabilistic programming languages and tools tightly couple model representations with specific inference algorithms, preventing experimentation with novel representations or mixed discrete-continuous models. We introduce a factor…
It is shown that a given non-autonomous system of two first-order ordinary differential equations can be expressed in Hamiltonian form. The derivation presented here allow us to obtain previously known results such as the infinite number of…
Integrable systems constitute an essential part of modern physics. Traditionally, to approve a model is integrable one has to find its infinitely many symmetries or conserved quantities. In this letter, taking the well known Korteweg-de…
We study inductive bias in Transformers in the infinitely over-parameterized Gaussian process limit and argue transformers tend to be biased towards more permutation symmetric functions in sequence space. We show that the representation…
The Newton method is a powerful optimization algorithm, valued for its rapid local convergence and elegant geometric properties. However, its theoretical guarantees are usually limited to convex problems. In this work, we ask whether…