Algebra and Logic

, Volume 53, Issue 5, pp 355–364

Generalized Computable Universal Numberings

Article

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.

Keywords

computability oracle universal computable numbering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Al-Farabi Kazakh National UniversityAlma-AtaKazakhstan
  2. 2.Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090 RussiaNovosibirsk State UniversityNovosibirskRussia

Personalised recommendations