  We consider the sets of dimensions for which there is an optimal sphere
packing with special regularity properties (respectively, a lattice, or a
periodic set with a given bound on the number of translations, or an arbitrary
periodic set). We show that all these sets are oracle-computable, given an
oracle that orders an associated set of spherical codes by increasing
Kolmogorov complexity.
