Related papers: Effective Capacity and Randomness of Closed Sets

This paper presents an analysis of the concept of capacity for noisy computations, i.e. algorithms implemented by unreliable computing devices (e.g. noisy Turing Machines). The capacity of a noisy computation is defined and justified by…

In this paper, we present a collection of results on the observability of quantum mechanical systems, in the case the output is the result of a discrete nonselective measurement. By defining an effective observable we extend previous…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Indeterminacy associated with probing of a quantum state is commonly expressed through spectral distances (metric) featured in the outcomes of repeated experiments. Here we express it as an effective amount (measure) of distinct outcomes…

In a separably connected space any two points are contained in a separable connected subset. We show a mechanism that takes a connected bounded metric space and produces a complete connected metric space whose separablewise components form…

By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the…

In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…

We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…

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…

We investigate conditions under which a co-computably enumerable set in a computable metric space is computable. Using higher-dimensional chains and spherical chains we prove that in each computable metric space which is locally computable…

This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…

Capacitary measures form a class of measures that vanish on sets of capacity zero. These measures are compact with respect to so-called $\gamma$-convergence, which relates a sequence of measures to the sequence of solutions of relaxed…

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…

We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1$ is a computable real, and if $\Omega$ is a nonzero, non-atomic, and separable measure space, then every…

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…

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

Quantum nonlocality offers a secure way to produce random numbers: their unpredictability is intrinsic and can be certified just by observing the statistic of the measurement outcomes, without assumptions on how they are produced. To do…

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

We introduce, for any bipartite Bell scenario, a measure that quantifies both the amount of nonlocality and the efficiency in device-independent quantum key distribution of a set of measurement outcomes probabilities. It is a proper measure…