Related papers: Co-c.e. spheres and cells in computable metric spa…

Let X be a G-space such that the orbit space X/G is metrizable. Suppose a family of slices is given at each point of X. We study a construction which associates, under some conditions on the family of slices, with any metric on X/G an…

We investigate the connection between measure and capacity for the space of nonempty closed subsets of {0,1}*. For any computable measure, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

The notion of g-frames for Hilbert spaces was introduced and studied by Wenchang Sun [16] as a generalization of the notion of frames. In this paper, we define computable g-frames in computable Hilbert spaces and obtain computable versions…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits…

We discuss some basic issues that arise when one attempts to model quantum mechanical systems on a computer, and we describe the mathematical structure of the resulting discretized cannonical commutation relations.

This paper considers the relevance of the concepts of observability and computability in physical theory. Observability is related to verifiability which is essential for effective computing and as physical systems are computational systems…

An \'{e}tale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and \'{e}tale spaces over a space. In…

We develop a link between degree estimates for rational sphere maps and compressed sensing. We provide several new ideas and many examples, both old and new, that amplify connections with linear programming. We close with a list of ten open…

We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's $\mathbb{T}$. We show that computably compact computable metric spaces admit representations of their compact subsets in such a…

We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the…

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…

The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…

We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative $C^*$ algebras.