Related papers: Slow Reflection
We consider a stable but nearly unstable autoregressive process of any order. The bridge between stability and instability is expressed by a time-varying companion matrix $A_{n}$ with spectral radius $\rho(A_{n}) < 1$ satisfying…
We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…
The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
We develop a novel and unifying setting for phase retrieval problems that works in Banach spaces and for continuous frames and consider the questions of uniqueness and stability of the reconstruction from phaseless measurements. Our main…
Convergence results for averages of independent replications of counting processes are established in a $p$-variation setting and under certain assumptions. Such convergence results can be combined with functional differentiability results…
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
Sample average approximation (SAA) replaces an intractable expected objective by an empirical average and is a basic device of modern stochastic optimization. We develop a rate theory for optimal values and empirical…
The consistency of a bootstrap or resampling scheme is classically validated by weak convergence of conditional laws. However, when working with stochastic processes in the space of bounded functions and their weak convergence in the…
We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of…
Birkhoff's theorem states that for an ergodic automorphism, the time averages converge to the space average. Given sequence $\psi(n)\to+0$, U. Krengel proved that for any ergodic automorphism there is an indicator such that the…
We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
In this paper we define the notion of slow divergence integral along sliding segments in regularized planar piecewise smooth systems. The boundary of such segments may contain diverse tangency points. We show that the slow divergence…
Representations of the Cuntz algebra $\mathcal{O}_N$ are constructed from interval dynamical systems associated with slow continued fraction algorithms introduced by Giovanni Panti. Their irreducible decomposition formulas are characterized…
We introduce the Primitive Eulerian polynomial $P_{\cal A}(z)$ of a central hyperplane arrangement ${\cal A}$. It is a reparametrization of its cocharacteristic polynomial. Previous work of the first author implicitly show that, for…
We derive an explicit representation for the transition law of a $p$-tempered $\alpha$-stable process of Ornstein-Uhlenbeck-type and use it to develop a methodology for simulation. Our results apply in both the univariate and multivariate…