Numbering (computability Theory) - Definition and Examples

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:

    The definition of good prose is proper words in their proper places; of good verse, the most proper words in their proper places. The propriety is in either case relative. The words in prose ought to express the intended meaning, and no more; if they attract attention to themselves, it is, in general, a fault.
    Samuel Taylor Coleridge (1772–1834)

    Histories are more full of examples of the fidelity of dogs than of friends.
    Alexander Pope (1688–1744)