Universal generalized computable numberings and hyperimmunity

Generalized computable numberings relative to hyperimmune and high oracles are studied. We give a description of oracles relative to which every finite computable family has a universal computable numbering. Also we present a characterization of the class of oracles relative to which every universal computable numbering of an arbitrary finite family is precomplete, and establish a sufficient condition for generalized computable numberings to be precomplete. In addition, we look into the question on boundedness of universal numberings computable relative to high oracles.