Generalized Computable Universal Numberings
- First Online:
- 66 Downloads
We aim to consider the notion of a computable numbering as a uniform enumeration of sets of a family relative to an arbitrary oracle. The questions under investigation concern primarily universal computable numberings. A study of this kind of numberings is mostly motivated by their nature since any universal numbering of a family contains information on all its computable numberings.
Keywordscomputability oracle universal computable numbering
Unable to display preview. Download preview PDF.