Related papers: Machine learning and the Continuum Hypothesis
We study the behavior of various set-functions under holomorphic motions. We show that, under such deformations, logarithmic capacity varies continuously, while analytic capacity may not.
A weighted sums of squares decomposition of positive Borel measurable functions on a bounded Borel subset of the Euclidean space is obtained via duality from the spectral theorem for tuples of commuting self-adjoint operators. The analogous…
We give characterizations of the Borel sets potentially in some Wadge class, among the Borel sets with countable vertical sections of a product of two Polish spaces. To do this, we use some partial uniformization results.
We resolve the topological version of the Erd\H{o}s Similarity conjecture introduced previously by Gallagher, Lai and Weber. We show that a set is topologically universal on ${\mathbb R}$ if and only if it is of strong measure zero. As a…
The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…
We consider the prediction of a basic thermodynamic property---hydration free energies---across a large subset of the chemical space of small organic molecules. Our in silico study is based on computer simulations at the atomistic level…
A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…
This survey articles focuses on emerging connections between the fields of machine learning and data compression. While fundamental limits of classical (lossy) data compression are established using rate-distortion theory, the connections…
We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…
The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…
The monad of convex sets of probability distributions is a well-known tool for modelling the combination of nondeterministic and probabilistic computational effects. In this work we lift this monad from the category of sets to the category…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, generally defined as a binary sequence. Previous works provided…
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 prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…
We specify a Turing machine $T_{\text{Mordell}}$ with the following properties. 1. On input $(K,C/K)$, with $K/\mathbb{Q}$ a number field and $C/K$ a smooth projective hyperbolic curve, if $T_{\text{Mordell}}$ terminates, then it outputs…