2577 search results - page 225 / 516 » Multimedia Question Answering |
168
click to vote
DM
2007
15 years 6 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
162
click to vote
JGT
2006
15 years 6 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
116
click to vote
JSYML
2006
15 years 6 months ago
2006
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
132
click to vote
MLQ
2006
15 years 6 months ago
2006
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
APAL
2005
15 years 6 months ago
2005
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...