WEAK REDUCIBILITY OF COMPUTABLE AND GENERALIZED COMPUTABLE NUMBERINGS

Abstract

We consider universal and minimal computable numberings with respect to weak reducibility. A family of total functions that have a universal numbering and two non-weakly equivalent computable numberings is constructed. A sufficient condition for the non-existence of minimal A-computable numberings of families with respect to weak reducibility is found for every oracle A.