Related papers: Solovay reducibility implies S2a-reducibility
In 1916, F.S. Macaulay developed specific localization techniques for dealing with "unmixed polynomial ideals" in commutative algebra, transforming them into what he called "inverse systems" of partial differential equations. In 1970, D.C.…
In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…
Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…
In the middle of the 1980s, David Poole introduced a semantical, model-theoretic notion of specificity to the artificial-intelligence community. Since then it has found further applications in non-monotonic reasoning, in particular in…
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…
In this paper we investigate the shrinking target property for irrational rotations. This was first studied by Kurzweil (1951) and has received considerable interest of late. Using a new approach, we generalize results of Kim (2007) and…
A semi-measure is a generalization of a probability measure obtained by relaxing the additivity requirement to super-additivity. We introduce and study several randomness notions for left-c.e. semi-measures, a natural class of effectively…
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…
The representation Skorohod theorem of weak convergence of random variables on a metric space goes back to Skorohod (1956) in the case where the metric space is the class of real-valued functions defined on [0,1] which are right-continuous…
Li, Chen, Li, Ma, and Vit\'anyi (2004) introduced a similarity metric based on Kolmogorov complexity. It followed work by Shannon in the 1950s on a metric based on entropy. We define two computable similarity metrics, analogous to the…
A real random variable admits median(s) and quantiles. These values minimize convex functions on $\mathbb R$. We show by "Convex Analysis" arguments that the function to be minimized is very natural. The relationship with some notions about…
We study generalizations of the Schr\"odinger problem in statistical mechanics in two directions: when the density is constrained at more than two times, and when the joint law of the initial and final positions for the particles is…
Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with these developments is analogous results for convergence of…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
We establish the rate of convergence of distributions of sums of independent identically distributed random variables to the Gaussian distribution in terms of truncated pseudomoments by implementing the idea of Yu. Studnyev for getting…
We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…
We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of…
In 1982, the theory of rough sets proposed by Pawlak and in 2013, Luay concerned a rough probability by using the notion of Topology. In this paper, we study the rough probability in the stochastic approximation spaces by using set-valued…