Related papers: Computably discrete represented spaces
The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…
Let $(A, A_o)$ be a topological quasi *-algebra, which means in particular that $A_o$ is a topological *-algebra, dense in $A$. Let $\pi^o$ be a *-representation of $A_o$ in some pre-Hilbert space ${\cal D} \subset {\cal H}$. Then we…
In this review paper, we demonstrate that several classes of point processes in a locally compact Polish space $X$ appear as the joint spectral measure of a rigorously defined particle density of a representation of the canonical…
We present and thoroughly study natural Polish spaces of separable Banach spaces. These spaces are defined as spaces of norms, resp. pseudonorms, on the countable infinite-dimensional rational vector space. We provide an exhaustive…
A topological space $X$ is called Piotrowski if every quasicontinuous map $f:Z\to X$ from a Baire space $Z$ to $X$ has a continuity point. In this paper we survey known results on Piotrowski spaces and investigate the relation of Piotrowski…
We define a numerical quasi-isometry invariant of a finitely generated group, whose values parametrize the difference between the group being uniformly embeddable in a Hilbert space and the reduced C*-algebra of the group being exact.
We show that the product of any number of sequentially pseudocompact topological spaces is still sequentially pseudocompact. The definition of sequential pseudocompactness can be given in (at least) two ways: we show their equivalence. Some…
In this paper we continue the analysis undertaken in a series of previous papers on structures arising as completions of C*-algebras under topologies coarser that their norm and we focus our attention on the so-called {\em locally convex…
Computational pseudorandomness studies the extent to which a random variable $\bf{Z}$ looks like the uniform distribution according to a class of tests $\cal{F}$. Computational entropy generalizes computational pseudorandomness by studying…
We study the topology of metric spaces which are definable in o-minimal expansions of ordered fields. We show that a definable metric space either contains an infinite definable discrete set or is definably homeomorphic to a definable set…
This paper studies the combinatorics of ideals which recently appeared in ergodicity results for analytic equivalence relations. The ideals have the following topological representation. There is a separable metrizable space $X$, a…
Probabilistic models based on continuous latent spaces, such as variational autoencoders, can be understood as uncountable mixture models where components depend continuously on the latent code. They have proven to be expressive tools for…
A space $X$ is called selectively separable(R-separable) if for every sequence of dense subspaces $(D_n : n\in\omega)$ one can pick finite (respectively, one-point) subsets $F_n\subset D_n$ such that $\bigcup_{n\in\omega}F_n$ is dense in…
We present examples of realcompact spaces with closed subsets that are C*-embedded but not C-embedded, including one where the closed set is a copy of the space of natural numbers.
Though many safety-critical software systems use floating point to represent real-world input and output, programmers usually have idealized versions in mind that compute with real numbers. Significant deviations from the ideal can cause…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…