An easy priority-free proof of a theorem of Friedberg
Using the priority method, \textit{R. M. Friedberg} [J. Symb. Logic 23, 309- 316 (1959; Zbl 0088.016)] proved that the class of all partial recursive unary functions can be enumerated without repetition. We present a new, straightforward proof of this result. The proof can be adapted for a wide variety of other r.e. classes.
scientific article; zbMATH DE number 4148068