501 research outputs found
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
AbstractThe main result of this paper lies in the framework of BSS computability: it shows roughly that any recursively enumerable set S in RN, N⩽∞, where R is a real closed field, is isomorphic to RdimS by a bijection ϕ which is decidable over S. Moreover the map S↦ϕ is computable. Some related matters are also considered like characterization of the real closed fields with a r.e. set of infinitesimals, and the dimension of r.e. sets
Computability Theory
Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science
Kolmogorov complexity and computably enumerable sets
We study the computably enumerable sets in terms of the: (a) Kolmogorov
complexity of their initial segments; (b) Kolmogorov complexity of finite
programs when they are used as oracles. We present an extended discussion of
the existing research on this topic, along with recent developments and open
problems. Besides this survey, our main original result is the following
characterization of the computably enumerable sets with trivial initial segment
prefix-free complexity. A computably enumerable set is -trivial if and
only if the family of sets with complexity bounded by the complexity of is
uniformly computable from the halting problem
Complexity of equivalence relations and preorders from computability theory
We study the relative complexity of equivalence relations and preorders from
computability theory and complexity theory. Given binary relations , a
componentwise reducibility is defined by R\le S \iff \ex f \, \forall x, y \,
[xRy \lra f(x) Sf(y)]. Here is taken from a suitable class of effective
functions. For us the relations will be on natural numbers, and must be
computable. We show that there is a -complete equivalence relation, but
no -complete for .
We show that preorders arising naturally in the above-mentioned
areas are -complete. This includes polynomial time -reducibility
on exponential time sets, which is , almost inclusion on r.e.\ sets,
which is , and Turing reducibility on r.e.\ sets, which is .Comment: To appear in J. Symb. Logi
Ultrafilter spaces on the semilattice of partitions
The Stone-Cech compactification of the natural numbers bN, or equivalently,
the space of ultrafilters on the subsets of omega, is a well-studied space with
interesting properties. If one replaces the subsets of omega by partitions of
omega, one can define corresponding, non-homeomorphic spaces of partition
ultrafilters. It will be shown that these spaces still have some of the nice
properties of bN, even though none is homeomorphic to bN. Further, in a
particular space, the minimal height of a tree pi-base and P-points are
investigated
On the relative complexity of hard problems for complexity classes without complete problems
AbstractWe show that any recursive sequence of recursive sets which is ascending with respect to the standard polynomial time reducibility notions has no minimal upper bound. As a consequence, any complexity class with certain natural closure properties possesses either complete problems or no easiest hard problems. A further corollary is that, assuming P ≠NP, the partial ordering of the polynomial time degrees of NP-sets is not complete, and that there are no degree invariant approximations to NP-complete problems
- …