Recursively Enumerable Set - Formal Definition

Formal Definition

A set S of natural numbers is called recursively enumerable if there is a partial recursive function (synonymously, a partial computable function) whose domain is exactly S, meaning that the function is defined if and only if its input is a member of S.

Read more about this topic:  Recursively Enumerable Set

Famous quotes containing the words formal and/or definition:

    “There must be a profound recognition that parents are the first teachers and that education begins before formal schooling and is deeply rooted in the values, traditions, and norms of family and culture.”
    —Sara Lawrence Lightfoot (20th century)

    “... 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)