Chapter 14 Theory of Numberings

Citations of this article
Mendeley users who have this article in their library.
Get full text


Publisher Summary This chapter introduces the problems of the theory of numberings, a developing branch of the algorithm theory. In the theory of numberings the necessary system of notions is being developed, natural questions are being arisen, and corresponding answers are being found. Those are the questions of dependency of various properties of a set on the choice of a numbering, an existence (uniqueness) of a numbering of a set possessing certain properties, and others. And as usual, in development of the theory, the inherent problems arise leading to unexpected beautiful and difficult theorems. Results obtained in the theory of numberings proved to be important for an understanding of some of the difficulties encountered in modern computer science. For instance, an important problem of contemporary programming is the problem of effective construction of a program to compute a function on a particular computer, given a program that computes the same function on the other computer. Practical realization of these translations for a pair of universal computers proves to be too difficult to be realized.




Ershov, Y. L. (1999). Chapter 14 Theory of Numberings. Studies in Logic and the Foundations of Mathematics, 140(C), 473–503.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free