1146 search results - page 16 / 230 » Finite cupping sets |
MLQ
1998
15 years 3 months ago
1998
116
click to vote
MST
2007
15 years 3 months ago
2007
We construct a finite language L such that the largest language commuting with L is not recursively enumerable. This gives a negative answer to the question raised by Conway in 1...
120
Voted
CCCG
2010
15 years 5 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...