  I discuss three issues connected to Bell's theorem and Bell-CHSH-type
experiments: time and the memory loophole, finite statistics (how wide are the
error bars Under Local Realism), and the question of whether a loophole-free
experiment is feasible, a surprising omission on Bell's list of four positions
to hold in the light of his results. Levy's (1935) theory of martingales, and
Fisher's (1935) theory of randomization in experimental design, take care of
time and of finite statistics. I exploit a (classical) computer network
metaphor for local realism to argue that Bell's conclusions are independent of
how one likes to interpret probability, and give a critique of some recent
anti-Bellist literature.
