Related papers: Computing with Continuous Objects: A Uniform Co-in…
The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex…
In intuitionistic mathematics, the Brouwer Continuity Theorem states that all total real functions are (uniformly) continuous on the unit interval. We study this theorem and related principles from the point of view of Reverse Mathematics…
In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function $f \colon X \to Y$ between $\operatorname{qcb}_0$-spaces one…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
We give a new proof of the Kat\v{e}tov-Tong theorem. Our strategy is to first prove the theorem for compact Hausdorff spaces, and then extend it to all normal spaces. The key ingredient is how the ring of bounded continuous real-valued…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…
This paper begins the study of infinite-dimensional modules defined on bicomplex numbers. It generalizes a number of results obtained with finite-dimensional bicomplex modules. The central concept introduced is the one of a bicomplex…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
We develop a matricial version of Rieffel's Gromov-Hausdorff distance for compact quantum metric spaces within the setting of operator systems and unital C*-algebras. Our approach yields a metric space of ``isometric'' unital complete order…
We introduce the notion of coarse metric. Every coarse metric induces a coarse structure on the underlying set. Conversely, we observe that all coarse spaces come from a particular type of coarse metric in a unique way. In the case when the…
This paper uses monads and comonads to establish a certain type of equivalence between two subcategories, one reflective and one coreflective, in a category whose objects represent compactifications of non-compact locally compact Hausdorff…
A cuf space (set, resp.) is a space (set, resp.) which is a countable union of finite subspaces (subsets, resp.). It is proved in $\mathbf{ZF}$ (with the absence of the axiom of choice) that all countable unions of cuf (denumerable, resp.)…
We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…
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…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
For a topological space $X$ a topological contraction on $X$ is a closed mapping $f:X\to X$ such that for every open cover of $X$ there is a positive integer $n$ such that the image of the space $X$ via the $n$th iteration of $f$ is a…
Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…
This paper studies proofs of strong convergence of various iterative algorithms for computing the unique zeros of set-valued accretive operators that also satisfy some weak form of uniform accretivity at zero. More precisely, we extract…