Related papers: Strong computable type
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
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.
In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…
In this paper we develop the homological version of $\Sigma$-theory for locally compact Hausdorff groups, leaving the homotopical version for another paper. Both versions are connected by a Hurewicz-like theorem. They can be thought of as…
Many important theorems in differential topology relate properties of manifolds to properties of their underlying homotopy types -- defined e.g. using the total singular complex or the \v{C}ech nerve of a good open cover. Upon embedding the…
We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…
Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…
Even in spaces of formal power series is required a topology in order to legitimate some operations, in particular to compute infinite summations. Many topologies can be exploited for different purposes. Combinatorists and algebraists may…
It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…
The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…
We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…
In their 2012 paper, Bobadilla and Koll\'ar studied topological conditions which guarantee that a proper map of complex algebraic varieties is a topological or differentiable fibration. They also asked whether a certain finiteness property…
A homeomorphism on a compact metric space is said hyper-expansive if every pair of different compact sets are separated by the homeomorphism in the Hausdorff metric. We characterize such dynamics as those with a finite number of orbits and…
For a compact space $K$ we denote by $C_w(K)$ ($C_p(K)$) the space of continuous real-valued functions on $K$ endowed with the weak (pointwise) topology. In this paper we address the following basic question which seems to be open: Suppose…
Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…
We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The…