抄録
We call a function from omega<omega to ω a predictor. A function f∈omegaomega is said to be constantly predicted by a predictor π, if there is an n<omega such that ∀ i<omega∃ j∈[i, i+n) (f(j)=π(f↑ j)). Let θomega denote the smallest size of a set ¶hi of predictors such that every f∈omegaomega can be constantly predicted by some predictor in ¶hi. In [{7}], we showed that θomega may be greater than cof(\mathscr{N}). In the present paper, we will prove that θomega may be smaller than \bm{d}.