Related papers: On The Computability of Perfect Subsets of Sets wi…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
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…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
We show that in doubling, geodesic metric measure spaces (including, for example, Euclidean space), sets of positive measure have a certain large-scale metric density property. As an application, we prove that a set of positive measure in…
Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…
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…
We study a strengthening of the notion of a perfectly meager set. We say that that a subset $A$ of a perfect Polish space $X$ is countably perfectly meager in $X$, if for every sequence of perfect subsets $\{P_n: n \in {\mathbb N}\}$ of…
A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…
We answer a question of Darji and Keleti by proving that there exists a compact set $C_0\subset\RR$ of measure zero such that for every perfect set $P\subset\RR$ there exists $x\in\RR$ such that $(C_0+x)\cap P$ is uncountable. Using this…
In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…
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 study a strengthening of the notion of a universally meager set and its dual counterpart that strengthens the notion of a universally null set. We say that a subset $A$ of a perfect Polish space $X$ is countably perfectly meager…
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…
We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's $\mathbb{T}$. We show that computably compact computable metric spaces admit representations of their compact subsets in such a…
We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…
This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
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).