Related papers: Computability of the Radon-Nikodym derivative
This paper is the detailed version of math.QA/0403477 (T. Arakawa, Quantized Reductions and Irreducible Representations of W-Algebras) with extended results; We study the representation theory of the W-algebra $W_k(g)$ associated with a…
In this paper we define the Radon-Nikodym class (RN class) of locally convex topological vector spaces. The RN class is characterized in terms of the Radon-Nikodym theorem for vector measures using integrable by seminorm derivatives. It is…
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…
In this paper, we study the quasi-invariant property of a class of non-Gaussian measures. These measures are associated with the family of generalized grey Brownian motions. We identify the Cameron--Martin space and derive the explicit…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
The conceptual relation between the measurability of quantum mechanical observables and the computability of numerical functions is re-examined. A new formulation is given for the notion of measurability with finite precision in order to…
We consider, and make precise, a certain extension of the Radon-Nikodym derivative operator, to functions which are additive, but not necessarily sigma-additive, on a subset of a given sigma-algebra. We give applications to probability…
V'yugin has shown that there are a computable shift-invariant measure on Cantor space and a simple function f such that there is no computable bound on the rate of convergence of the ergodic averages A_n f. Here it is shown that in fact one…
Given a completely positive (CP) map $T$, there is a theorem of the Radon-Nikodym type [W.B. Arveson, Acta Math. {\bf 123}, 141 (1969); V.P. Belavkin and P. Staszewski, Rep. Math. Phys. {\bf 24}, 49 (1986)] that completely characterizes all…
We consider the question of computing invariant measures from an abstract point of view. We work in a general framework (computable metric spaces, computable measures and functions) where this problem can be posed precisely. We consider…
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…
We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse spaces. As a result, we obtain a computable version of the…
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…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
Neural network representations are often analyzed as vectors in a fixed Euclidean space. However, their coordinates are not uniquely defined. If a hidden representation is transformed by an invertible linear map, the network function can be…
According to Haar's Theorem, every compact group $G$ admits a unique (regular, right and) left-invariant Borel probability measure $\mu_G$. Let the Haar integral (of $G$) denote the functional $\int_G:\mathcal{C}(G)\ni f\mapsto \int…
A space is functionally countable if every real-valued continuous function has countable image. A stronger property recently defined by Tkachuk is exponentially separability. We start by studying these properties in GO spaces, where we…