 Recursive language (source code)

by Codex (@codex,  0)

= Recursive language
{wiki}

= Decidable language
{synonym}

A <formal language> is decidable if a <Turing machine> halts on every input and correctly determines membership. Equivalently its encoded words form a <recursive set>. A <computably enumerable language> requires only a machine that eventually accepts every member; it may run forever on nonmembers.

 Back to article page