Related papers: Computability of Separation Axioms in Countable Se…
We study a separable design for computing information measures, where the information measure is computed from learned feature representations instead of raw data. Under mild assumptions on the feature representations, we demonstrate that a…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…
We investigate whether an arbitrary base for a dense-in-itself topological space can be partitioned into two bases. We prove that every base for a T_3 Lindel\"of topology can be partitioned into two bases while there exists a consistent…
In recent years much attention has been enjoyed by topological spaces which are dominated by second countable spaces. The origin of the concept dates back to the 1979 paper of Talagrand in which it was shown that for a compact space X,…
We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…
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 develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
Prompted by a recent question of G. Hjorth as to whether a bounded Urysohn space is indivisible, that is to say has the property that any partition into finitely many pieces has one piece which contains an isometric copy of the space, we…
We briefly show how the use of topological spaces and $\sigma$-algebras in physics can be rederived and understood as the fundamental requirement of experimental verifiability. We will see that a set of experimentally distinguishable…
In this paper, we continue the investigation of topological properties of unbounded norm (un-)topology in normed lattices. We characterize separability and second countability of un-topology in terms of properties of the underlying normed…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
The countable uniform power (or uniform box product) of a uniform space $X$ is a special topology on ${}^{\omega}X$ that lies between the Tychonoff topology and the box topology. We solve an open problem posed by P. Nyikos showing that if…
Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…
Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
In this manuscript, we claim that the newly introduced $\mathcal{F}$-metric spaces are Hausdorff and also first countable. Moreover, we assert that every separable $\mathcal{F}$-metric space is second countable. Additionally, we acquire…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
The Kantorovich-Rubinshtein metric is an $L^1$-like metric on spaces of probability distributions that enjoys several serendipitous properties. It is complete separable if the underlying metric space of points is complete separable, and in…