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 physicians say, they are not materialists; but they are:MSpirit is matter reduced to an extreme thinness: O so thin!—But the definition of spiritual should be, that which is its own evidence. What notions do they attach to love! what to religion! One would not willingly pronounce these words in their hearing, and give them the occasion to profane them.”
—Ralph Waldo Emerson (1803–1882)
“No rules exist, and examples are simply life-savers answering the appeals of rules making vain attempts to exist.”
—André Breton (1896–1966)