Related papers: Computing with Continuous Objects: A Uniform Co-in…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with…
In 1951, Diliberto and Straus proposed a levelling algorithm for the uniform approximation of a bivariate function, defined on a rectangle with sides parallel to the coordinate axes, by sums of univariate functions. In the current paper, we…
Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…
In this paper we give a unitary approach for the simultaneous study of the convergence of discrete and integral operators described by means of a family of linear continuous functionals acting on functions defined on locally compact…
We study the general form of isomorphisms on the algebra of compactly supported complex-valued continuous functions defined on a locally compact Hausdorff space (the proof of which works for the algebra of $C^k-$differentiable functions on…
Compact metric spaces form an important class of metric spaces, but the category that they define lacks many important properties such as completeness and cocompleteness. In recent studies of "metric domain theory" and Stone-type dualities,…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
The purpose of this article is to relate coarse cohomology of metric spaces with a more computable cohomology. We introduce a notion of boundedly supported cohomology and prove that coarse cohomology of many spaces are isomorphic to the…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
Continuous mappings between compact Hausdorff spaces can be studied using homomorphisms between algebraic structures (lattices, Boolean algebras) associated with the spaces. This gives us more tools with which to tackle problems about these…
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…
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…
In this paper, we present a constructive generalization of metric and uniform spaces by introducing a new class of spaces, called cover spaces. These spaces form a topological concrete category with a full reflective subcategory of complete…
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…
We introduce Lipschitz continuous and $C^{1,1}$ geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in $\mathbb{R}^n$ by using…
The class of Hausdorff spaces that are continuous images of compact orderable spaces is studied by analyzing the relationship between the elements of this class and compact orderable spaces in a back-and-forth fashion. Structure results for…