Friedberg numbering
In computability theory, a Friedberg numbering is a numbering of the set of all uniformly recursively enumerable sets that has no repetitions: each recursively enumerable set appears exactly once in the enumeration.
The existence of such numberings was established by Richard M. Friedberg in 1958.
