Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent’s moves. Recently, such games with quantitative winning conditions in weak MSO with the unbounding quantifier were studied, but their properties turned out to be unsatisfactory. In particular, unbounded lookahead is in general necessary. Here, we study delay games ...

After a brief review of the production dynamics of prompt single photons in hadron collisions, I summarize a new QCD calculation of the transverse momentum distribution of continuum prompt photon pairs produced by QCD subprocesses, including all-orders soft-gluon resummation valid at next-to-next-to-leading logarithmic accuracy. Resummation is necessary to obtain reliable predictions, as well a...

We introduce a natural strengthening of prompt simplicity which we call strong promptness, and study its relationship with existing lowness classes. This notion provides a ≤wtt version of superlow cuppability. We show that every strongly prompt c.e. set is superlow cuppable. Unfortunately, strong promptness is not a Turing degree notion, and so cannot characterize the sets which are superlow cu...