Related papers: Computability of the Radon-Nikodym derivative
The Radon-Nikodym formalism is used to study the structure of the set of positive maps from $\mathcal{B}(\mathcal{H})$ into itself, where $\mathcal{H}$ is a finite dimensional Hilbert space. In particular, this formalism was employed to…
An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably…
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…
We describe (infinite-dimensional) irreducible representations of the crossed product C$^*$-algebra associated with a topological dynamical system (based on $Z$) and we show that their restrictions to the underling $\ell^1$-Banach…
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…
We study the representation theory of the superconformal algebra $W_k(g,f_{\theta})$ associated with a minimal gradation of $g$. Here, $g$ is a simple finite-dimensional Lie superalgebra with a non-degenerate, even supersymmetric invariant…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
We consider finite W-algebras U(g,e) associated to even multiplicity nilpotent elements in classical Lie algebras. We give a classification of finite dimensional irreducible U(g,e)-modules with integral central character in terms of the…
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…
We call a function constructible if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. For any $q > 0$ and…
We introduce a notion of measure contracting actions and show that Koopman representations corresponding to ergodic measure contracting actions are irreducible. As a corollary we obtain that Koopman representations associated to canonical…
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large" topological spaces. This framework has been applied to study the complexity of the differential operator and the…
In this article, we review some aspects of logarithmic conformal field theories which can be inferred from the characters of irreducible submodules of indecomposable modules. We will mainly consider the W(2,2p-1,2p-1,2p-1) series of triplet…
We introduce the notion of W-measurable sensitivity, which extends and strictly implies canonical measurable sensitivity, a measure- theoretic version of sensitive dependence on initial conditions. This notion also implies pairwise…
Let G be a closed subgroup of the group of all permutations of a countably infinite set. Let X be a Polish G-space with a countable basis A of clopen sets. Each x from X defines a characteristic function f on A by f(U)=1 iff x belongs to U…
We study presentations of $C^*(X)$ that are evaluative over a presentation of $X$ in that $(f,p) \mapsto f(p)$ is computable. We prove existence-uniqueness theorems for such presentations. We use our methods to prove an effective…
We announce here a number of results concerning representation theory of the algebra $R=k<x,y>/ (xy-yx-y^2)$, known as Jordan plane (or Jordan algebra). We consider the question on 'classification' of finite-dimensional modules over the…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
We collect several foundational results regarding the interaction between locally compact spaces, probability spaces and probability algebras, and commutative $C^*$-algebras and von Neumann algebras equipped with traces, in the…
We prove various extensions of the Tennenbaum phenomenon to the case of computable quotient presentations of models of arithmetic and set theory. Specifically, no nonstandard model of arithmetic has a computable quotient presentation by a…