Related papers: A computability-theoretic reformulation of the Con…

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

Consider an inclusion of diffuse von Neumann algebras A c M . We say that A c M has the absorbing amenability property if for any diffuse subalgebra B c A and any amenable intermediate algebra B c D c M we have that D is contained in A. We…

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…

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…

Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…

Any algebra herein is intended over a field of characteristic 0. Let $E$ denote the infinite dimensional Grassman algebra. Given a power associative finite dimensional {$\mathbb{Z}_2$-graded-central-simple} $A$ and a supertrace algebra $B$,…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

Let $\mathcal{L}(H)$ be the $*$-algebra of all bounded operators on an infinite dimensional Hilbert space $H$ and let $(\mathcal{I}, \|\cdot\|_{\mathcal{I}})$ be an ideal in $\mathcal{L}(H)$ equipped with a Banach norm which is distinct…

We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

We show that the class of 1-exact operator systems is not uniformly definable by a sequence of types. We use this fact to show that there is no finitary version of Arveson's extension theorem. Next, we show that WEP is equivalent to a…

Guionnet et al. gave a construction of a II_1 factor associated to a subfactor planar algebra. In this paper we define an unshaded planar algebra. To any unshaded planar algebra P we associate a finite von Neumann algebra M_P. We prove that…

As a consequence of Kirchberg's work, Connes' Embedding Conjecture is equivalent to the property that every homomorphism of the group $F_\infty\times F_\infty$ into the unitary group $U(\ell^2)$ with the strong topology is pointwise…

Computational properties of the Hahn-Banach theorem have been studied in computable, constructive and reverse mathematics and in all these approaches the theorem is equivalent to weak K\H{o}nig's lemma. Gherardi and Marcone proved that this…

Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…

Transfer learning for feature extraction can be used to exploit deep representations in contexts where there is very few training data, where there are limited computational resources, or when tuning the hyper-parameters needed for training…

Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…

We introduce a method for using deep neural networks to amortize the cost of inference in models from the family induced by universal probabilistic programming languages, establishing a framework that combines the strengths of probabilistic…