Related papers: How to Compute Halting
If two random variables X and A are functionally related via f(X)=A for some strictly monotone continuously differentiable function f:R->R, the distribution of X may easily be computed from the distribution of A.
We outline a method of calculation of partition functions of orientable manifolds with fluctuating metric and perform the calculation for the specific case of the unit interval.
A new interpretation of zeta functions is given for F1-schemes which do not satisfy Soul\'e's condition. Functional equations for reductive groups are computed and a new definition of zeta functions attached to more general counting…
We study large deviation asymptotics for processes defined in terms of continued fraction digits. We use the continued fraction digit sum process to define a stopping time and derive a joint large deviation asymptotic for the upper and…
We propose an automated method for proving termination of $\pi$-calculus processes, based on a reduction to termination of sequential programs: we translate a $\pi$-calculus process to a sequential program, so that the termination of the…
This article is concerned with stability and performance of controlled stochastic processes under receding horizon policies. We carry out a systematic study of methods to guarantee stability under receding horizon policies via appropriate…
We prove an analytic version of the stable graph regularity lemma from \cite{MaSh}, which applies to stable functions $f\colon V\times W\to [0,1]$. Our methods involve continuous model theory and, in particular, results on the structure of…
The aim of this note is to present a self-contained proof of the fact that a function can be approximated using a linear combination of Gaussian coherent states, with a number of terms controlled in terms of the smoothness and of the decay…
We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered…
We consider the task of computing functions $f: \mathbb{N}^k\to \mathbb{N}$, where $ \mathbb{N}$ is the set of natural numbers, by finite teams of agents modelled as deterministic finite automata. The computation is carried out in a…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
A new formula for the probability that a standard Brownian motion stays between two linear boundaries is proved. A simple algorithm is deduced. Uniform precision estimates are computed. Different implementations have been made available…
A preliminary result on Subhomogeneous Cooperative Time-delay Systems, subject to revision.
For nice functions, invariant means over integral currents (certain generalized surfaces), can be uniquely defined.
The article provides the formula for the calculation the falling time of inverted pendulum. The result is expressed in terms of elliptic integrals of first kind. The asymptotic formula for small initial inclination value is also provided.
The work studies some Difference equations, which are connected with Mejer's function.
For a stable process, we give an explicit formula for the potential measure of the process killed outside a bounded interval and the joint law of the overshoot, undershoot and undershoot from the maximum at exit from a bounded interval. We…
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…
Motivated by existing results, we present some completely monotonic functions involving the polygamma functions.
Programs with multiphase control-flow are programs where the execution passes through several (possibly implicit) phases. Proving termination of such programs (or inferring corresponding runtime bounds) is often challenging since it…