Sciweavers

1146 search results - page 1 / 230
» Finite cupping sets
Sort
View
AML
2004
73views more  AML 2004»
13 years 5 months ago
Finite cupping sets
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....
Andrew Lewis
ROBOCUP
2005
Springer
98views Robotics» more  ROBOCUP 2005»
13 years 10 months ago
RoboCup X: A Proposal for a New League Where RoboCup Goes Real World
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...
Tijn van der Zant, Thomas Wisspeintner
TCS
2008
13 years 5 months ago
A finite set of functions with an EXPTIME-complete composition problem
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 ...
Marcin Kozik
IJAC
2000
70views more  IJAC 2000»
13 years 5 months ago
Finitely Based, Finite Sets of Words
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...
Marcel Jackson, Olga Sapir
AML
2010
91views more  AML 2010»
13 years 5 months ago
The limitations of cupping in the local structure of the enumeration degrees
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 ...
Mariya Ivanova Soskova