Related papers: Fixpoints and relative precompleteness
Let $Q$ denote the space of signed measures on the Borel $\sigma$-algebra of a separable complete space $X$. We endow $Q$ with the norm $\|q\|=\sup|\int\phi dq|$, where the supremum is taken over all Lipschitz with constant 1 functions…
This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the…
We prove an approximation theorem on a class of domains in $\mathbb{C}^n$ on which the $\overline{\partial}$-problem is solvable in $L^{\infty}$. Furthermore, as a corollary, we obtain a version of the Axler-\v{C}u\v{c}kovi\'c-Rao Theorem…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…
In computational complexity, a complexity class is given by a set of problems or functions, and a basic challenge is to show separations of complexity classes $A \not= B$ especially when $A$ is known to be a subset of $B$. In this paper we…
Existing definitions of the relativizations of \NCOne, \L\ and \NL\ do not preserve the inclusions $\NCOne \subseteq \L$, $\NL\subseteq \ACOne$. We start by giving the first definitions that preserve them. Here for \L\ and \NL\ we define…
Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…
Approximate computing is a research area where we investigate a wide spectrum of techniques to trade off computation accuracy for better performance or energy consumption. In this work, we provide a general introduction to approximate…
We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…
We study a class of countably-infinite-dimensional linear programs (CILPs) whose feasible sets are bounded subsets of appropriately defined spaces of measures. The optimal value, optimal points, and minimal points of these CILPs can be…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
With a grading previously introduced by the second-named author, the multiplication maps in the preprojective algebra satisfy a maximal rank property that is similar to the maximal rank property proven by Hochster and Laksov for the…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial values and real number coefficients in the bit-model of real computation. We show…
Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…