Admissible numbering
In computability theory, admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted "to and from" the standard numbering. These numberings are also called acceptable numberings and acceptable programming systems. Rogers' equivalence theorem shows that all acceptable programming systems are equivalent to each other in the formal sense of numbering theory. Definition. The formalization of computability theory by Kleene led to a particular universal partial computable function Ψ("e", "x") defined using the T predicate. This function is universal in the sense that it is partial computable, and for any partial computable function  f there is an "e" such that, for all "x", "f"("x") = Ψ("e","x"), where the equality means that either both sides are undefined or both are defined and are equal. It is common to write ψ("x") for Ψ("e","x"); thus the sequence ψ, ψ, ... is an enumeration of all partial computable functions. Such enumerations are formally called computable numberings of the partial computable functions. An arbitrary numbering η of partial functions is defined to be an "admissible numbering" if: Here, the first bullet requires the numbering to be computable; the second requires that any index for the numbering η can be  converted effectively to an index to the numbering ψ; and the third requires that any index for the numbering ψ can be effectively converted to an index for the numbering η. Rogers' equivalence theorem. Hartley Rogers, Jr. showed that a numbering η of the partial computable functions is admissible if and only if there is a total computable bijection "p" such that, for all "e", η = ψ (Soare 1987:25).