  We study clockability for Ordinal Turing Machines (OTMs). In particular, we
show that, in contrast to the situation for ITTMs, admissible ordinals can be
OTM-clockable, that $\Sigma_{2}$-admissible ordinals are never OTM-clockable
and that gaps in the OTM-clockable ordinals are always started by admissible
limits of admissible ordinals.
