Related papers: Taking the path computably travelled

The path component space of a topological space $X$ is the quotient space $\pi_0(X)$ whose points are the path components of $X$. We show that every Tychonoff space $X$ is the path-component space of a Tychonoff space $Y$ of weight…

Let $\kappa$ be an infinite regular cardinal. We define a topological space $X$ to be $T_{\kappa-Borel}$-space (resp. a $T_{\kappa-BP}$-space) if for every $x\in X$ the singleton $\{x\}$ belongs to the smallest $\kappa$-additive algebra of…

We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…

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 study the position of the computable setting in the "common theory of locality" developed in arXiv:2106.02066 and arXiv:2204.09329 for local problems on $\Delta$-regular trees, $\Delta \in \omega$. We show that such a problem admits a…

The iteration of rational maps is well-understood in dimension 1 but less so in higher dimensions. We study some maps on spaces of matrices which present a weak complexity with respect to the ring structure. First we give some properties of…

This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by…

Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure…

Let $\pi$ be a discrete group, and let $G$ be a compact connected Lie group. $\mathrm{Hom}(\pi,G)_0$ denotes the null-component of the space of homomorphisms from $\pi$ to $G$, and $\mathrm{map}_*(B\pi,BG)_0$ denotes the null-component of…

It is shown that, modulo an equivalence relation induced by finite correspondences preserving Cantor rank, the class of topological spaces is an integral semi-ring on which the Cantor derivative is precisely a derivation.

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

We have developed the concept of pathway assembly to explore the amount of extrinsic information required to build an object. To quantify this information in an agnostic way, we present a method to determine the amount of pathway assembly…

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…

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…

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences of rewrites', computational paths can be seen as the grounds on which the…

Physical processes are computations only when we use them to externalize thought. Computation is the performance of one or more fixed processes within a contingent environment. We reformulate the Church-Turing thesis so that it applies to…

We prove that every homogeneous countable dense homogeneous topological space containing a copy of the Cantor set is a Baire space. In particular, every countable dense homogeneous topological vector space is a Baire space. It follows that,…

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…

We prove that the Reeb space of a proper definable map $f:X \rightarrow Y$ in an arbitrary o-minimal expansion of a real closed field is realizable as a proper definable quotient. This result can be seen as an o-minimal analog of Stein…

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…