Related papers: Computability Theory, Nonstandard Analysis, and th…
In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
As suggested by the title, the aim of this paper is to uncover the vast computational content of classical Nonstandard Analysis. To this end, we formulate a template $\mathfrak{CI}$ which converts a theorem of 'pure' Nonstandard Analysis,…
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
Non-monotone inductive definitions were studied in the late 1960's and early 1970's with the aim of understanding connections between the complexity of the formulas defining the induction steps and the size of the ordinals measuring the…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We take a resource-theoretic approach to the problem of quantifying nonclassicality in Bell scenarios. The resources are conceptualized as probabilistic processes from the setting variables to the outcome variables having a particular…
Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust…
Given a property $P$ of subspaces of a $T_1$ space $X$, we say that $X$ is {\em $P$-bounded} iff every subspace of $X$ with property $P$ has compact closure in $X$. Here we study $P$-bounded spaces for the properties $P \in \{\omega D,…
Shape(-and-scale) spaces - configuration spaces for generalized Kendall-type Shape(-and-Scale) Theories - are usually not manifolds but stratified manifolds. While in Kendall's own case - similarity shapes - the shape spaces are…
This paper outlines new paradigms for real analysis and computability theory in the recently proposed non-Aristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts…
We prove various results in infinite-dimensional differential calculus which relate differentiability properties of functions and associated operator-valued functions (e.g., differentials). The results are applied in two areas: 1. in the…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admits preservation of some computability-theoretic weakness…
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…
ASD (Abstract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same category as the original space, with an associated…