Related papers: Coarse computability, the density metric, Hausdorf…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
This paper concerns algorithms that give correct answers with (asymptotic) density $1$. A dense description of a function $g : \omega \to \omega$ is a partial function $f$ on $\omega$ such that $\left\{n : f(n) = g(n)\right\}$ has density…
The paper is devoted to the study of the Gromov-Hausdorff proper class, consisting of all metric spaces considered up to isometry. In this class, a generalized Gromov-Hausdorff pseudometric is introduced and the geometry of the resulting…
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
Inspired by group cohomology, we define several coarse topological invariants of metric spaces. We define the coarse cohomological dimension of a metric space, and demonstrate that if G is a countable group, then the coarse cohomological…
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…
For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…
A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…
Given a countable set S of positive reals, we study finite-dimensional Ramsey-theoretic properties of the countable ultrametric Urysohn space with distances in S.
In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…
Motivated by persistent homology and topological data analysis, we consider formal sums on a metric space with a distinguished subset. These formal sums, which we call persistence diagrams, have a canonical 1-parameter family of metrics…
A certain Grothendieck topology assigned to a metric space gives rise to a sheaf cohomology theory which sees the coarse structure of the space. Already constant coefficients produce interesting cohomology groups. In degree 0 they see the…
In spaces of metrics, we investigate topological distributions of the doubling property, the uniform disconnectedness, and the uniform perfectness, which are the quasi-symmetrically invariant properties appearing in the David--Semmes…
In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We prove that sets with well-defined intrinsic density (and…
By a quantum metric space we mean a C^*-algebra (or more generally an order-unit space) equipped with a generalization of the Lipschitz seminorm on functions which is defined by an ordinary metric. We develop for compact quantum metric…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…