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 xS and f(x) = 0 if xS . 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 spiritual kinship between Lincoln and Whitman was founded upon their Americanism, their essential Westernism. Whitman had grown up without much formal education; Lincoln had scarcely any education. One had become the notable poet of the day; one the orator of the Gettsyburg Address. It was inevitable that Whitman as a poet should turn with a feeling of kinship to Lincoln, and even without any association or contact feel that Lincoln was his.
    Edgar Lee Masters (1869–1950)

    No man, not even a doctor, ever gives any other definition of what a nurse should be than this—”devoted and obedient.” This definition would do just as well for a porter. It might even do for a horse. It would not do for a policeman.
    Florence Nightingale (1820–1910)