Recursive Set - Formal Definition

Formal Definition

A subset S of the natural numbers is called recursive if there exists a total computable function f such that f(x) = 1 if x ∈ S and f(x) = 0 if x ∉ S . In other words, the set S is recursive if and only if the indicator function 1S is computable.

Read more about this topic:  Recursive Set

Famous quotes containing the words formal and/or definition:

    “The bed is now as public as the dinner table and governed by the same rules of formal confrontation.”
    —Angela Carter (1940–1992)

    “One definition of man is “an intelligence served by organs.””
    —Ralph Waldo Emerson (1803–1882)