English
Related papers

Related papers: Six Birds: Foundations of Emergence Calculus

200 papers

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

A compound Poisson process whose parameters are all unknown is observed at finitely many equispaced times. Nonparametric estimators of the jump and L\'evy distributions are proposed and functional central limit theorems using the uniform…

Statistics Theory · Mathematics 2017-02-06 Alberto J. Coca

We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…

Logic · Mathematics 2024-12-12 Emmanuel Rauzy

By integrating 4 lines of thoughts: symmetry breaking originally advanced by Anderson, bifurcation from nonlinear dynamics, Landau's theory of phase transition, and the mechanism of emergent rare events studied by Kramers, we introduce a…

Statistical Mechanics · Physics 2016-11-04 Hong Qian , Ping Ao , Yuhai Tu , Jin Wang

A foundational assumption in complex-system collapse studies is that critical transitions are second-order, preceded by early-warning signals like rising autocorrelation, variance, and critical slowing down (Scheffer, 2009). We show this…

Artificial Intelligence · Computer Science 2026-03-17 Truong Xuan Khanh , Truong Quynh Hoa

We show how the existence of three objects, $\Omega_{\rm trap}$, ${\bf W}$, and $C$, for a continuous piecewise-linear map $f$ on $\mathbb{R}^N$, implies that $f$ has a topological attractor with a positive Lyapunov exponent. First,…

Dynamical Systems · Mathematics 2020-10-19 David J. W. Simpson

DEKL 2.0 is a dependent type-theoretic framework for trace-indexed knowledge evolution. Its central claim is that the proof calculus remains monotone under standard structural rules, while non-monotonic behavior arises semantically from…

Logic in Computer Science · Computer Science 2026-04-27 Chen Peng

In this paper, we develop a novel accelerated fixed-point-based framework using delayed inexact oracles to approximate a fixed point of a nonexpansive operator (or equivalently, a root of a co-coercive operator), a central problem in…

Optimization and Control · Mathematics 2025-12-16 Nghia Nguyen-Trung , Quoc Tran-Dinh

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

Combinatorics · Mathematics 2007-05-23 Jeremy J. Carroll

This paper studies theory and inference related to a class of time series models that incorporates nonlinear dynamics. It is assumed that the observations follow a one-parameter exponential family of distributions given an accompanying…

Statistics Theory · Mathematics 2012-04-19 Richard A. Davis , Heng Liu

We use duality techniques - specifically Siegmund and Bernstein duality - as tools to analyse ergodic and recurrence properties of $[0,1]$-valued Markov processes. These dualities enable the derivation of sharp bounds on the distance to…

Probability · Mathematics 2025-07-11 Fernando Cordero , Grégoire Véchambre

We construct complete asymptotic expansions of solutions of the 1D semiclassical Schr\"odinger equation near transition points. There are three main novelties: (1) transition points of order $\kappa\geq 2$ (i.e.\ trapped points -- the…

Classical Analysis and ODEs · Mathematics 2025-10-15 Ethan Sussman

The concept of exceptional point (EP) is demonstrated experimentally in the case of a simple mechanical system consisting of two linearized coupled pendulums. Exceptional points correspond to specific values of the system parameters that…

Computational Physics · Physics 2024-02-08 Nicolas Even , Benoit Nennig , Gautier Lefebvre , Emmanuel Perrey-Debain

Milner's complete proof system for observational congruence is crucially based on the possibility to equate $\tau$ divergent expressions to non-divergent ones by means of the axiom $recX. (\tau.X + E) = recX. \tau. E$. In the presence of a…

Logic in Computer Science · Computer Science 2023-06-22 Mario Bravetti

Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…

Computational Complexity · Computer Science 2020-05-13 Shaull Almagor , Dmitry Chistikov , Joël Ouaknine , James Worrell

We establish elements of a new approch to ellipticity and parametrices within operator algebras on a manifold with higher singularities, only based on some general axiomatic requirements on parameter-dependent operators in suitable scales…

Analysis of PDEs · Mathematics 2008-02-11 Jamil Abed , Bert-Wolfgang Schulze

We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…

Combinatorics · Mathematics 2026-02-12 Shalender Singh , Vishnu Priya Singh

Classical and new numerical schemes are generated using evolutionary computing. Differential Evolution is used to find the coefficients of finite difference approximations of function derivatives, and of single and multi-step integration…

Neural and Evolutionary Computing · Computer Science 2014-01-02 C. D. Erdbrink , V. V. Krzhizhanovskaya , P. M. A. Sloot

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Logic in Computer Science · Computer Science 2010-10-15 Marie Ferbus-Zanda , Serge Grigorieff
‹ Prev 1 4 5 6 7 8 10 Next ›