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:
“‘Tis very certain that each man carries in his eye the exact indication of his rank in the immense scale of men, and we are always learning to read it. A complete man should need no auxiliaries to his personal presence.”
—Ralph Waldo Emerson (1803–1882)
“The task he undertakes
Is numbering sands and drinking oceans dry.”
—William Shakespeare (1564–1616)