Complete Numbering

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:

    Although those notes, in conformity with custom, come after the poem, the reader is advised to consult them first and then study the poem with their help, rereading them of course as he goes through its text, and perhaps after having done with the poem consulting them a third time so as to complete the picture.
    Vladimir Nabokov (1899–1977)

    The task he undertakes
    Is numbering sands and drinking oceans dry.
    William Shakespeare (1564–1616)