30 search results - page 3 / 6 » The ibT degrees of computably enumerable sets are not dense |
APAL
2010
13 years 7 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
APAL
1998
13 years 7 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
FCS
2009
13 years 5 months ago
2009
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
APAL
2005
13 years 7 months ago
2005
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...