Precomplete numberings

In this survey, we discuss the theory of precomplete numberings which appear frequently in computability theory. Precomplete numberings are closely related to some variants of fixed point theorem having an important methodological value. This sometimes permits to eliminate cumbersome proofs involving the so called priority method in favour of elegant and simple applications of this theorem. In a sense, this paper covers the part of computability theory that may be developed by elementary methods.