Related papers: Machine learning and the Continuum Hypothesis
We develop an analogue of the classical Scott analysis for metric structures and infinitary continuous logic. Among our results are the existence of Scott sentences for metric structures and a version of the Lopez-Escobar theorem. We also…
This paper describes a family of probabilistic architectures designed for online learning under the logarithmic loss. Rather than relying on non-linear transfer functions, our method gains representational power by the use of data…
In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
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…
We develop a dilation theory for row contractions subject to constraints determined by sets of noncommutative polynomials. Under natural conditions on the constraints, we have uniqueness for the minimal dilation. A characteristic function…
We study continuity and discontinuity of the upper and lower (modified) box-counting, Hausdorff, packing, (modified) correlation measure-dimension mappings under the weak, setwise and TV topology on the space of Borel measures respectively…
Bell's theorem is reformulated and proved in the pure mathematical terms of automata theory, avoiding any physical or ontological notions. It is stated that no pair of finite probabilistic sequential machines can reproduce in its output the…
We propose to interpret machine learning functions as physical observables, opening up the possibility to apply "standard" statistical-mechanical methods to outputs from neural networks. This includes histogram reweighting and finite-size…
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…
We consider reducibility of equivalence relations (ERs, for brevity), in a nonstandard domain, in terms of the Borel reducibility and the countably determined (CD, for brevity) reducibility. This reveals phenomena partially analogous to…
We prove several results related to the theorem of Logvinenko and Sereda on determining sets for functions with Fourier transforms supported in an interval. We obtain a polynomial instead of exponential bound in this theorem, and we extend…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
We investigate coresets - succinct, small summaries of large data sets - so that solutions found on the summary are provably competitive with solution found on the full data set. We provide an overview over the state-of-the-art in coreset…
We show how well known tools of algebraic geometry for the study of finite sets can be fruitfully applied to the study of Waring decompositions of symmetric tensors (forms). We mainly focus on the uniqueness of a given decomposition (the…
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Following Davies, Elekes and Keleti, we study measured sets, i.e. Borel sets $B$ in $\mathbb{R}$ (or in a Polish group) for which there is a translation invariant Borel measure assigning positive and \sigma-finite measure to $B$. We…
Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…