We show that there exists a single minimal (Turing) degree b < 0 s.t. for all c.e. degrees 0 < a < 0 , 0 = a b. Since b is minimal this means that b complements all c.e....
To put more emphasis on real-world problems, the authors propose to extend the RoboCup competitions. In order to foster progress in the desired abilities the authors propose to exp...
We exhibit a finite family of functions over a finite set (i.e. a finite algebra) such that the problem whether a given function can be obtained as a composition of the members of ...
For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W. This monoid is denoted by...
Abstract We prove that a sequence of sets containing representatives of cupping partners for every nonzero 0 2 enumeration degree cannot have a 0 2 enumeration. We also prove that ...