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.
Read more about Complete Numbering: Definition, Examples
Famous quotes containing the words complete and/or numbering:
“For which of you, intending to build a tower, does not first sit down and estimate the cost, to see whether he has enough to complete it?”
—Bible: New Testament, Luke 14:28.
“The task he undertakes
Is numbering sands and drinking oceans dry.”
—William Shakespeare (1564–1616)