Related papers: Fixpoints and relative precompleteness
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…
In this paper, we present a comprehensive system for the treatment of the topic of limits--conceptually, computationally, and formally. The system addresses fundamental linguistic flaws in the standard presentation of limits, which attempts…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
We study the completeness and ultracompleteness numbers of a convergence space. In the case of a completely regular topological space, the completeness number is countable if and only if the space is $\v{C}$ech-complete, and the…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…
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 introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
It is well known that many theorems in recursion theory can be "relativized". This means that they remain true if partial recursive functions are replaced by functions that are partial recursive relative to some fixed oracle set. Uspensky…
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…
We investigate the role of continuous reductions and continuous relativisation in the context of higher randomness. We define a higher analogue of Turing reducibility and show that it interacts well with higher randomness, for example with…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
In the first part of this article we prove that one of the conditions required in the original definition of nearly Frobenius algebra, the coassociativity, is redundant. Also, we determine the Frobenius dimension of the product and tensor…