Complete numbering
In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal'tsev in 1963. They are studied because several important results like the Kleene's recursion theorem and Rice's theorem, which were originally proven for the Gödel-numbered set of computable functions, still hold for arbitrary sets with complete numberings.
Wikipedia contributors, "Complete numbering", Wikipedia, revision 1019576317, retrieved 20 November 2026, source, CC BY-SA 4.0.