Related papers: On the computational content of the Loeb measure
These lecture notes, to be completed in a later version, offer a short and rigorous introduction to Nostandard Analysis, mainly aimed to reach to a presentation of the basics of Loeb integration, and in particular, Loeb measures. The…
The aim of this paper is to highlight a hitherto unknown computational aspect of Nonstandard Analysis. Recently, a number of nonstandard versions of Goedel's system T have been introduced ([2,9,12]), and it was shown in [26] that the…
Currently the two popular ways to practice Robinson's nonstandard analysis are the model-theoretic approach and the axiomatic/syntactic approach. It is sometimes claimed that the internal axiomatic approach is unable to handle constructions…
The aim of this paper is to highlight a hitherto unknown computational aspect of Nonstandard Analysis pertaining to Reverse Mathematics (RM). In particular, we shall establish RM-equivalences between theorems from Nonstandard Analysis in a…
We consider a natural measure of relevance: the reduction in optimal prediction risk in the presence of side information. For any given loss function, this relevance measure captures the benefit of side information for performing inference…
We develop a differential formulation of the Loeb Scale that extends the original static framework into a radially evolving, real time classification scheme for interstellar objects. By promoting each anomaly metric to a function of…
Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of…
Martin-Lof's definition of random sequences of cbits as those not belonging to any set of constructive zero Lebesgue measure is reformulated in the language of Algebraic Probability Theory. The adoption of the Pour-El Richards theory of…
The aim of this contribution is to bring together the areas of $p$-adic analysis and nonstandard analysis. We develop a nonstandard measure theory with values in a complete non-Archimedean valued field $K$, e.g. the $p-$adic numbers…
In this paper, we highlight a new computational aspect of Nonstandard Analysis relating to higher-order computability theory. In particular, we prove that the Gandy-Hyland functional equals a primitive recursive functional involving…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
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 investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
Non standard analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from classical analysis can be expressed very naturally. Cheap non-standard analysis introduced by…
The notion of a partition on a set is mathematically dual to the notion of a subset of a set, so there is a logic of partitions dual to Boole's logic of subsets (Boolean subset logic is usually mis-specified as the special case of…
Nelson's stochastic mechanics may be understood as a stochastic underpinning, or reconstruction, of nonrelativistic quantum mechanics, once the diffusion scale is fixed by $\hbar$ and the admissible states are restricted by the usual…
Although some information-theoretic measures of uncertainty or granularity have been proposed in rough set theory, these measures are only dependent on the underlying partition and the cardinality of the universe, independent of the lower…
This note has several aims. Firstly, it portrays a non-standard analysis as a functor, namely a functor * that maps any set A to the set *A of its non-standard elements. That functor, from the category of sets to itself, is postulated to be…
Inspired by nonstandard analysis, we define and study internal subsets and internal functions in algebras of Colombeau generalized functions. We prove a saturation principle for internal sets and provide applications to Colombeau algebras.
Numerical reasoning based machine reading comprehension is a task that involves reading comprehension along with using arithmetic operations such as addition, subtraction, sorting, and counting. The DROP benchmark (Dua et al., 2019) is a…