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:
“Your views are now my own.”
—Marvin Cohen, U.S. author and humorist.
In conversation, after having taken a strong position in an argument and heard a complete refutation of his position.
“The task he undertakes
Is numbering sands and drinking oceans dry.”
—William Shakespeare (1564–1616)