We give a su cient condition for an in nite computable family of 􀀀1 a sets, to have computable positive but undecidable numberings, where a is a notation for a nonzero computable ordinal. This extends a theorem proved ...