Related papers: Computability of the Radon-Nikodym derivative
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f…
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…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
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…
In this paper, we first introduce $\mathbb{L}$-$\mu$-measurable functions and $\mathbb{L}$-Bochner integrable functions on a finite measure space $(S,\mathcal{F},\mu),$ and give an $\mathbb{L}$-valued analogue of the canonical…
For an arbitrary topological group G any compact G-dynamical system (G,X) can be linearly G-represented as a weak*-compact subset of a dual Banach space V*. As was shown by Megrelishvili (2003), the Banach space V can be chosen to be…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
Some topics concerning the Gould integral are presented here: new results of integrability on finite measure spaces with values in an M-space are given, together with a Radon-Nikodym theorem relative to a Gould-type integral of real…
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
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 the present paper it is shown that real function $g(x)=\int_{0}^{x}f(t)dt$ is a linear-space computable real function on interval $[0,1]$ if $f$ is a linear-space computable $C^2[0,1]$ real function on interval $[0,1]$, and this result…
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…
Admissible vectors lead to frames or coherent states under the action of a group by means of square integrable representations. This work shows that admissible vectors can be seen as weights with central support on the (left) group von…
We consider positive operator valued measures whose image is the bounded operators acting on an infinite-dimensional Hilbert space, and we relax, when possible, the usual assumption of positivity of the operator valued measure seen in the…
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…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…
We discuss the problem of estimating Radon-Nikodym derivatives. This problem appears in various applications, such as covariate shift adaptation, likelihood-ratio testing, mutual information estimation, and conditional probability…