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:
“Mothers often are too easily intimidated by their children’s negative reactions...When the child cries or is unhappy, the mother reads this as meaning that she is a failure. This is why it is so important for a mother to know...that the process of growing up involves by definition things that her child is not going to like. Her job is not to create a bed of roses, but to help him learn how to pick his way through the thorns.”
—Elaine Heffner (20th century)
“There are many examples of women that have excelled in learning, and even in war, but this is no reason we should bring ‘em all up to Latin and Greek or else military discipline, instead of needle-work and housewifry.”
—Bernard Mandeville (1670–1733)