Related papers: Left computably enumerable reals and initial segme…
The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…
This paper contains two parts. The first is the solution of a challenge question, proposed by Etienne Ghys, on the determination of all maps from rational numbers to themselves such that the difference quotient (f(x)-f(y))/(x-y) is always a…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We introduce a concept of the bounded rank (with respect to a positive constant) for unital C*-algebras as a modification of the usual real rank and present a series of conditions insuring that bounded and real ranks coincide. These…
An algebra is said to be quasi-directly finite when any left-invertible element in its unitization is automatically right-invertible. It is an old observation of Kaplansky that the von Neumann algebra of a discrete group has this property;…
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 show that the Schubert calculus of enumerative geometry is real, for special Schubert conditions. That is, for any such enumerative problem, there exist real conditions for which all the a priori complex solutions are real.
Odrzywo\l{}ek defined a system Exp-Minus-Log (EML) that reduces all elementary functions over complex numbers down to a constant `$1$', and a single two place function $E(\alpha, \beta) = \exp(\alpha) - \log(\beta)$. This paper shows that…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
We initiate the study of the effective content of $K$-theory for $\mathrm{C}^*$-algebras. We prove that there are computable functors which associate, to a computably enumerable presentation of a $\mathrm{C}^*$-algebra $\boldA$, computably…
We study computable probably approximately correct (CPAC) learning, where learners are required to be computable functions. It had been previously observed that the Fundamental Theorem of Statistical Learning, which characterizes PAC…
Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…
In the present article we review an approximation procedure for amenable traces on unital and separable C*-algebras acting on a Hilbert space in terms of F\o lner sequences of non-zero finite rank projections. We apply this method to…
We present a new method for expressing Chaitin's random real, Omega, through Diophantine equations. Where Chaitin's method causes a particular quantity to express the bits of Omega by fluctuating between finite and infinite values, in our…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
Let $\xi, \zeta$ be quadratic real numbers in distinct quadratic fields. We establish the existence of effectively computable, positive real numbers $\tau$ and $c$, such that, for every integer $q$ with $q > c$ we have $$ \max\{\|q \xi \|,…
In this paper we give characterizations of essential left ideals of a C*-algebra $A$ in terms of their properties as operator $A$-modules. Conversely, we seek C*-algebraic characterizations of those ideals $J$ in $A$ such that $A$ is an…
We introduce the notion of a complex cell, a complexification of the cells/cylinders used in real tame geometry. For $\delta\in(0,1)$ and a complex cell $\mathcal{C}$ we define its holomorphic extension…
Frames play an important role in various practical problems related to signal and image processing. In this paper, we define computable frames in computable Hilbert spaces and obtain computable versions of some of their characterizations.…