Related papers: Solovay reduction and continuity
Statistical uncertainties complicate engineering design -- confounding regulated design approaches, and degrading the performance of reliability efforts. The simplest means to tackle this uncertainty is double loop simulation; a nested…
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…
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…
We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…
We prove a reducibility result for a linear wave equation with a time quasi-periodic driving on the one dimensional torus. The driving is assumed to be fast oscillating, but not necessarily of small size. Provided that the external…
Contact reduction is very closely related to symplectic reduction, but it allows symmetries that are not manifest in Hamiltonian mechanics and moreover, solution of the reduced problems yields solution of the original problem without…
We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…
We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…
We show that attractors are semicontinuous for closed relations on compact Hausdorff spaces. Semicontinuity is what guarantees that small changes to a system do not result in massive growth of certain features, notably attractors. That is,…
We give a purely algebraic treatment of reduction theory for connections over the formal punctured disc. Our proofs apply to arbitrary connected linear algebraic groups over an algebraically closed field of characteristic 0. We also state…
Martin-L\"of (ML)-reducibility compares $K$-trivial sets by examining the Martin-L\"of random sequences that compute them. We show that every $K$-trivial set is computable from a c.e.\ set of the same ML-degree. We investigate the interplay…
We present a criterion of reducibility of a zero curvature representation to a solvable subalgebra, hence to a chain of conservation laws. Namely, we show that reducibility is equivalent to the existence of a section of the generalized…
Lower semi-continuity (\texttt{LSC}) is a critical assumption in many foundational optimisation theory results; however, in many cases, \texttt{LSC} is stronger than necessary. This has led to the introduction of numerous weaker continuity…
Lyapunov-Schmidt reduction is a dimensionality reduction technique in nonlinear systems analysis that is commonly utilised in the study of bifurcation problems in high-dimensional systems. The method is a systematic procedure for reducing…
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…
Recently we proposed relative observability for supervisory control of discrete-event systems under partial observation. Relative observability is closed under set unions and hence there exists the supremal relatively observable sublanguage…
Reproducibility is one of the core dimensions that concur to deliver Trustworthy Artificial Intelligence. Broadly speaking, reproducibility can be defined as the possibility to reproduce the same or a similar experiment or method, thereby…
The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…