An approach to the classification of minimal numberings of families of arithmetical sets

We generalize the concept of an effectively minimal numbering obtained by its relativization with respect to the Turing jumps of subsets of nonnegative integers. Basing on this generalization, we classify the minimal numberings computable in the arithmetical and hyperarithmetical hierarchies.