Related papers: Effective Versions of Strong Measure Zero
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets…
We show that the following are consistent with ZFC: 1. Strongly meager sets form an ideal with the same additivity as the ideal of meager sets. 2. There exists a strong measure zero set of size > d (dominating number).
The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
We develop a theory of \emph{sharp measure zero} sets that parallels Borel's \emph{strong measure zero}, and prove a theorem analogous to Galvin-Myscielski-Solovay Theorem, namely that a set of reals has sharp measure zero if and only if it…
Certain countably and finitely additive measures can be associated to a given nonnegative supermartingale. Under weak assumptions on the underlying probability space, existence and (non)uniqueness results for such measures are proven.
We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…
We investigate the notion of strong measure zero sets in the context of the higher Cantor space $2^\kappa$ for $\kappa$ at least inaccessible. Using an iteration of perfect tree forcings, we give two proofs of the relative consistency of \[…
Given a positive random variable $X$, $X\ge0$ a.s., a null hypothesis $H_0:E(X)\le\mu$ and a random sample of infinite size of $X$, we construct test supermartingales for $H_0$, i.e. positive processes that are supermartingale if the null…
In this paper, we derive power guarantees of some sequential tests for bounded mean under general alternatives. We focus on testing procedures using nonnegative supermartingales which are anytime valid and consider alternatives which…
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…
We prove that it is relatively consistent with $\mathrm{ZFC}$ that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel's conjecture fails). This answers a…
Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…
We prove that any strongly mixing action of a countable abelian group on a probability space has higher order mixing properties. This is achieved via introducing and utilizing $\mathcal R$-limits, a notion of convergence which is based on…
We are given a bounded Borel-measurable real-valued function on a product of countably many Polish spaces, and a product probability measure. We are interested in points in the product space that can be used to approximate the expected…
We design sequential tests for a large class of nonparametric null hypotheses based on elicitable and identifiable functionals. Such functionals are defined in terms of scoring functions and identification functions, which are ideal…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…