Definition and Examples
A numbering of a set is a partial surjective function from to S (Ershov 1999:477). The value of a numbering ν at a number i (if defined) is often written ν'i instead of the usual .
For example, the set of all finite subsets of has a numbering γ in which and (Ershov 1999:477).
As a second example, a fixed Gödel numbering of the computable partial functions can be used to define a numbering W of the recursively enumerable sets, by letting by W(i) be the domain of φi.
Read more about this topic: Numbering (computability Theory)
Famous quotes containing the words definition and/or examples:
“... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.”
—George Eliot [Mary Ann (or Marian)
“No rules exist, and examples are simply life-savers answering the appeals of rules making vain attempts to exist.”
—André Breton (1896–1966)